The generalized tree quorum protocol
- 1 December 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 17 (4) , 689-717
- https://doi.org/10.1145/146931.146935
Abstract
In this paper, we present a low-cost fault-tolerant protocol for managing replicated data. We impose a logical tree structure on the set of copies of an object and develop a protocol that uses the information available in the logical structure to reduce the communication requirements for read and write operations. The tree quorum protocol is a generalization of the static voting protocol with two degrees of freedom for choosing quorums. In general, this results in significantly lower communication costs for comparable data availability. The protocol exhibits the property of graceful degradation, i.e., communication costs for executing operations are minimal in a failure-free environment but may increase as failures occur. This approach in designing distributed systems is desirable since it provides fault-tolerance without imposing unnecessary costs on the failure-free mode of operations.Keywords
This publication has 23 references indexed in Scilit:
- Locks with constrained sharing (extended abstract)Published by Association for Computing Machinery (ACM) ,1990
- Exploiting logical structures in replicated databasesInformation Processing Letters, 1990
- Maintaining availability in partitioned replicated databasesACM Transactions on Database Systems, 1989
- Performance characterization of quorum-consensus algorithms for replicated dataIEEE Transactions on Software Engineering, 1989
- A proof technique for concurrency control and recovery algorithms for replicated databasesDistributed Computing, 1987
- How to assign votes in a distributed systemJournal of the ACM, 1985
- Consistency in a partitioned network: a surveyACM Computing Surveys, 1985
- Achieving robustness in distributed database systemsACM Transactions on Database Systems, 1983
- Notes on data base operating systemsPublished by Springer Nature ,1978
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976