• Corpus ID: 239050234

Efficient Consensus-Free Weight Reassignment for Atomic Storage

@article{Heydari2021EfficientCW,
  title={Efficient Consensus-Free Weight Reassignment for Atomic Storage},
  author={Hasan Heydari and Guthemberg Silvestre and Luciana Arantes},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.10666}
}
Weighted voting is a conventional approach to improving the performance of replicated systems based on commonly-used majority quorum systems in heterogeneous environments. In long-lived systems, a weight reassignment protocol is required to reassign weights over time in order to accommodate performance variations accordingly. The weight reassignment protocol should be consensus-free in asynchronous failure-prone systems because of the impossibility of solving consensus in such systems. This… 

Figures from this paper

References

SHOWING 1-10 OF 32 REFERENCES
Efficient and Modular Consensus-Free Reconfiguration for Fault-Tolerant Storage
TLDR
This work proposes FreeStore, a set of fault-tolerant protocols that emulates a register in dynamic asynchronous systems in which processes are able to join/leave the servers set during the execution.
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
TLDR
An efficient algorithm for managing replicated data that imposes a logical tree structure on the set of copies of an object that provides faulttolerance without imposing unnecessary costs on the failure-free mode of operations.
Dynamic atomic storage without consensus
TLDR
It is discovered that dynamic R/W storage is solvable in a completely asynchronous system: DynaStore, an algorithm that solves this problem is presented.
SmartMerge: A New Approach to Reconfiguration for Atomic Storage
TLDR
This paper presents SmartMerge, a novel approach that provides most of the benefits of consensus-based reconfiguration, yet can be implemented in a fully asynchronous system.
Increasing availability under mutual exclusion constraints with dynamic vote reassignment
TLDR
These results demonstrate that under high failure rates, dynamic vote reassignment shows great improvement over a static assignment of votes in terms of availability, and many autonomous methods for determining a new vote assignment yield almost as much availability as a group consensus method and at the same time are faster and more flexible.
AWARE: Adaptive Wide-Area Replication for Fast and Resilient Byzantine Consensus
TLDR
AWARE is an automated and dynamic voting weight tuning and leader positioning scheme, which supports the emergence of fast quorums in the system, and employs a reliable self-monitoring process and provides a prediction model seeking to minimize the system's consensus latency.
Minimizing Response Time for Quorum-System Protocols over Wide-Area Networks
  • Florian Oprea, M. Reiter
  • Computer Science
    37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)
  • 2007
TLDR
New algorithms for placing quorums in wide-area networks and tuning which quorum clients access are proposed, so as to optimize clients' average response time in quorum-based protocols.
On Liveness of Dynamic Storage
TLDR
This work defines a dynamic eventually perfect failure detector, and presents an algorithm that uses it to emulate wait-free dynamic atomic storage, and is the first to ensure liveness for all operations without restricting the reconfiguration rate.
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
TLDR
It is shown that, given a collection of n copies of an object, the method allows a quorum to be formed with n/sup 0.63/ copies versus ((n+1)/2) copies in the case of the majority voting algorithm.
Dynamic voting algorithms for maintaining the consistency of a replicated database
TLDR
It is proved that under the site model, dynamic-linear has greater availability than any static algorithm, including weighted voting, if there are four or more sites in the network.
...
1
2
3
4
...