Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Algorithms for mutual exclusion
Algorithms for mutual exclusion
The availability of quorum systems
Information and Computation
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Information and Computation
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
REPLICATION METHODS FOR ABSTRACT DATA TYPES
REPLICATION METHODS FOR ABSTRACT DATA TYPES
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the availability of non-strict quorum systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Prophecy: using history for high-throughput fault tolerance
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Probabilistically bounded staleness for practical partial quorums
Proceedings of the VLDB Endowment
Probabilistic opaque quorum systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
Single-writer k-quorum protocols achieve high availability without incurring the risk of read operations returning arbitrarily stale values: in particular, they guarantee that, even in the presence of an adversarial scheduler, any read operation will return the value written by one of the last k writes. In this paper, we expand our understanding of k-quorums in two directions: first, we present a single-writer k-quorum protocol that tolerates Byzantine server failures; second, we extend the single-writer k-quorum protocol to a multi-writer solution that applies to both the benign and Byzantine cases. For a system with m writers, we prove a lower bound of ${\big( (2m-1)(k-1) + 1 \big)}$ on the staleness of any multi-writer protocol built over a single-writer k-quorum system and propose a multi-writer protocol that provides an almost matching staleness bound of ${\big( (2m-1)(k-1) + m \big)}$.