This Article 
 Bibliographic References 
 Add to: 
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
September 1991 (vol. 40 no. 9)
pp. 996-1004

A novel algorithm for managing replicated data is presented. The proposed method is based on organizing the copies of an object into a logical, multilevel hierarchy, and extending the quorum consensus algorithm to such an environment. Several properties of the method are derived and optimality conditions are given for minimizing the quorum size. 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. Tradeoffs between the proposed method and three other quorum-based methods are discussed, and the main features of each method are highlighted.

[1] D. Agrawal and A. El Abbadi, "An efficient and fault-tolerant algorithm for distributed mutual exclusion," inProc. Eight Annu. ACM Symp. Principles Distributed Comput., 1989.
[2] M. Ahamad and M. H. Ammar, "Performance characterization of quorum-consensus algorithms for replicated data,"IEEE Trans. Software Eng., vol. 15, pp. 492-495, Apr. 1989.
[3] D. Barbara, H. Garcia-Molina, and A. Spauster, "Protocols for dynamic vote reassignment," inProc. ACM Conf. Principles Distributed Comput., 1986, pp. 195-205.
[4] S. Y. Cheunget al., "Optimizing vote and quorum assignments for reading and writing replicated data," inProc. Fifth IEEE Int. Conf. Data Eng., Los Angeles, CA, Jan. 1989.
[5] S. Y. Cheunget al., "Multi-dimensional voting: A general method for implementing synchronization in distributed systems," inProc. Tenth Int. Conf. Distributed Comput. Syst., Paris, June 1990.
[6] D. Davcev and W. Burkhard, "Consistency and recovery control for replicated files," inProc. 10th Symp. Operating System Principles, Orcas Island, WA, Dec. 1985, pp. 87-96.
[7] D. L. Eager and K. C. Sevcik, "Achieving robustness in distributed data-base systems,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 354-381, Sept. 1983.
[8] A. El Abbadi, D. Skeen, and F. Cristian, "An efficient, fault-tolerant protocol for replicated data management, inProc. 4th ACM SIGACT-SIGMOD Symp. Principles Database Syst., Portland, OR, Mar. 1985, pp. 215-228.
[9] H. Garcia-Molina and D. Barbara, "How to assign votes in a distributed systems,"J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[10] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[11] M. Herlihy, "Dynamic quorum adjustment for partitional data,"ACM Trans. Database Syst., vol. 12, no. 2, pp. 170-194, June 1987.
[12] S. Jajodia and D. Mutchler, "Dynamic voting," inProc. 1987 ACM SIGMOD, San Francisco, CA, May 1987, pp. 227-238.
[13] A. Kumar and A. Segev, "Optimizing voting-type algorithms for replicated data," Lecture Notes in Computer Science, vol. 303, J. W. Schmidt, S. Ceri, and M. Missekoff, Eds. New York: Springer-Verlag. Mar. 1988, pp. 428-442.
[14] M. Maekawa, "A√N algorithm for mutual exclusion in decentralized systems,"ACM Trans. Comput. Syst., vol. 3, no. 2, May 1985.
[15] J. F. Paris, "Voting with witnesses: A consistency scheme for replicated files," inProc. Sixth Int. Conf. Distributed Comput. Syst., May 1986.
[16] J. F. Paris and D. Long, "Efficient dynamic voting," inProc. Fourth IEEE Int. Conf. Data Eng., Los Angeles, CA, Jan. 1988.
[17] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180-209, June 1979.

Index Terms:
hierarchical quorum consensus; replicated data; quorum consensus algorithm; majority voting algorithm; database theory.
A. Kumar, "Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data," IEEE Transactions on Computers, vol. 40, no. 9, pp. 996-1004, Sept. 1991, doi:10.1109/12.83661
Usage of this product signifies your acceptance of the Terms of Use.