How to assign votes in a distributed system
Journal of the ACM (JACM)
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
Quorum structures in distributed systems
Quorum structures in distributed systems
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
The availability of quorum systems
Information and Computation
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The load and availability of Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Synchronous Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
The load, capacity and availability of quorum systems
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
Quorum systems have been used to implement many coordination problems in distributed systems. In this paper, we propose a reformulation of the definition of Byzantine quorum systems. Our reformulation captures the requirement for non-blocking access to quorums in asynchronous systems. We formally define the asynchronous access cost of quorum systems and we show that the asynchronous access cost and not the size of a quorum is the right measure of message complexity of protocols using quorums in asynchronous systems. We also show that previous quorum systems proposed in the literature have a very high asynchronous access cost. We present new quorum systems with low asynchronous access cost and whose other performance parameters match those of the best Byzantine quorum systems proposed in the literature. In particular, we present a construction for the disjoint failure pattern that outperforms previously proposed systems for that pattern.