This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Delay-Optimal Quorum Consensus for Distributed Systems
January 1997 (vol. 8 no. 1)
pp. 59-69

Abstract—Given a set of nodes S, a coterie is a set of pairwise intersecting subsets of S. Each element in a coterie is called a quorum. Mutual exclusion in a distributed system can be achieved if each request is required to get consensus from a quorum of nodes. This technique of quorum consensus is also used for replicated distributed database systems, and bicoteries and wr-coteries have been defined to capture the requirements of read and write operations in user transactions. In this paper, we are interested in finding coteries, bicoteries, and wr-coteries with optimal communication delay. The protocols take into account the network topology. We design delay-optimal quorum consensus protocols for network topologies of trees, rings, and clustered networks.

[1] A. El Abbadi and S. Toue.g., "Availability in Partitioned Replicated Databases (extended abstract)," Proc. Fifth ACM Symp. Principles of Database Systems, pp. 240-251, Mar. 1986.
[2] D. Agrawal and A.E. Abbadi, An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion ACM Trans. Computing Systems, vol. 9, no. 1, pp. 1-20, 1991.
[3] D. Barbara and H. Garcia-Molina, "The Vulnerability of Vote Assignments," ACM Trans. Computer Systems, vol. 4, pp. 187-213, Aug. 1986.
[4] P.A. Bernstein and N. Goodman, "An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases," ACM Trans. Database Systems, vol. 9, no. 4, pp. 596-615, Dec. 1984.
[5] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[6] D. Agrawal and A. El Abbadi, "The Generalized Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data," ACM Trans. Database Systems, vol. 17, no. 4, pp. 689-717, Dec. 1992.
[7] A. El Abbadi and S. Toueg, "Maintaining Availability in Partitioned Replicated Databases," ACM Trans. Databases Systems, vol. 14, no. 2, pp. 264-290, June 1989.
[8] M. Fredman and L. Khachiyan, "On the Complexity of Dualizationof Monotone Disjunctive Normal Forms," Technical Report LCSR-TR-225, Dept. of Computer Science, Rutgers Univ., 1994.
[9] A. Fu, "Enhancing Concurrency and Availability for Database Systems," PhD thesis, Simon Fraser Univ., Apr. 1990.
[10] A. Fu, M.H. Wong, T.W. Lau, and G.F. Ng, "Cost Optimal Coteries," Technical Report CS-TR-94-07, Chinese Univ. of Hong Kong, 1994.
[11] H. Garcia-Molina and D. Barbara, “How to Assign Votes in a Distributed System,” J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[12] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150-159, Dec. 1979.
[13] J.N. Gray, "The Cost of Messages," Proc. Seventh Ann. Symp. Principles of Distributed Computing,Toronto, Ont., Canada, pp. 1-7, Aug. 1988.
[14] J. Gray, "Parallelism: The New Imperative in Computer Architecture," Tutorial Notes, Int'l Conf. Very Large Databases, VLDB, 1994.
[15] M. Herlihy, "A Quorum-Consensus Replication Method for Abstract Data Types," ACM Trans. Computer Systems, vol. 4, no. 1, pp. 32-53, Feb. 1986.
[16] M. Herlihy, "Dynamic Quorum Adjustment for Partitioned Data," ACM Trans. Database Systems, vol. 12, no. 2, pp. 170-194, June 1987.
[17] T. Ibaraki and T. Kameda, "A Theory of Coteries: Mutual Exclusion in Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 779-794, July 1993.
[18] T. Ibaraki, H. Nagamochi, and T. Kameda, "Optimal Coteries for Rings and Related Networks," Proc. 12th Int'l Conf. Distributed Computing Systems, pp. 650-656, June 1992.
[19] T. Ibaraki, H. Nagamochi, and T. Kameda, "Optimal Coteries for Rings and Related Networks," Distributed Computing, no. 8, pp. 191-201, 1995.
[20] A. Kumar, “Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data,” IEEE Trans. Computers, vol. 40, no. 9, pp. 996-1,004, Sept. 1991.
[21] M. Maekawa, “A$\sqrt N $Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145-159, May 1985.
[22] C. Papadimitriou and M. Sideri, "Optimal Coteries," Proc. ACM Symp. Principles of Distributed Computing, ACM, Aug. 1991.
[23] D. Peleg and A. Wool, “Crumbling Walls: A Class of Practical and Efficient Quorum Systems,” Proc. 14th ACM Symp. Principles of Distributed Computing, pp. 120-129, 1995.
[24] B.C. Tansel, R.L. Francis, and T.J. Lowe, "Location on Networks: A Survey, Part I: The P-Center and P-Median Problems" Management Science, vol. 29, no. 4, pp. 482-497, Apr. 1983.
[25] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.
[26] O. Wolfson and A. Milo, "The Multicast Policy and Its Relationship to Replicated Data Placement," ACM Trans. Database Systems, vol. 16, no. 1, 1991.

Index Terms:
Mutual exclusion, quorum consensus, wide-area networks, distributed systems, replicated database systems, coteries, communication delay, network topology.
Citation:
Ada Waichee Fu, "Delay-Optimal Quorum Consensus for Distributed Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 1, pp. 59-69, Jan. 1997, doi:10.1109/71.569655
Usage of this product signifies your acceptance of the Terms of Use.