This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion
May 1997 (vol. 8 no. 5)
pp. 533-537

Abstract—A generalization of the majority quorum for the solution of the distributed (k + 1)-exclusion problem is proposed. This scheme produces a family of quorums of varying sizes and availabilities indexed by integral divisors r of k. The cases r = 1 and r = k correspond to known majority based quorum generation algorithms MAJ and DIV, whereas intermediate values of r interpolate between these two extremes. A cost and availability analysis of the proposed methods is also presented. An interesting implication of this analysis is that in a reasonably reliable environment with a large number of sites, even protocols with low communication costs attain high availability.

[1] D. Agrawal, Ö. ${\rm E\mathord{\buildrel{\lower3pt\hbox{$\scriptscriptstyle\smile$}}\over g} ecio\mathord{\buildrel{\lower3pt\hbox{$\scriptscriptstyle\smile$}}\over g} lu}$, A. El Abbadi, "Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion," Technical Report TRCS96-11, Dept. of Computer Science, Univ. of California, Santa Barbara, 1996.
[2] D. Agrawal and A. El Abbadi, “Exploiting Logical Structures in Replicated Databases,” Information Processing Letters, vol. 33, pp. 255-260, 1990.
[3] 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.
[4] M. Ahamad and M.H. Ammar, "Performance Characterization of Quorum-Consensus Algorithms for Replicated Data," IEEE Trans. Software Eng., vol. 15, no. 4, pp. 492-495, Apr. 1989.
[5] D.I.A. Cohen, Basic Techniques of Combinatorial Theory.New York: John Wiley and Sons, 1978.
[6] S. Fujita, M. Yamashita, and T. Ae, "Distributed k-Mutual Exclusion Problem and k-Coteries," Proc. Symp. Algorithms, pp. 22-31, 1991.
[7] 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.
[8] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150-159, Dec. 1979.
[9] S.T. Huang, J.R. Jiang, and Y.C. Kuo, K-Coteries for Fault-Tolerant k Entries to a Critical Section Proc. 13th Int'l Conf. Distributed Computing Systems, pp. 74-81, May 1993.
[10] H. Kakugawa, S. Fujita, M. Yamashita, T. Ae, Availability ofk-Coterie IEEE Trans. Computers, vol. 42, no. 5, pp. 553-558, May 1993.
[11] N. Krishnakumar and A.J. Bernstein, "Bounded Ignorance in Replicated Systems," Proc. 10th ACM Symp. Principles of Database Systems, pp. 63-74, May 1991.
[12] 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.
[13] 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.
[14] S. Ranagarajan and S. Tripathi, "Robust Distributed Mutual Exclusion Algorithms," Proc. Fifth Int'l Workshop Distributed Algorithms, pp. 295-308. Lecture Notes in Computer Science, 579, Springer-Verlag, Oct. 1991.
[15] K. Raymond, "A Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 30, no. 4, pp. 189-193, Feb. 1989.
[16] G. Ricart and A. K. Agrawala, “An Optimal Algorithm for Mutual Exclusion in Computer Networks,” Comm. ACM, vol. 24, no. 1, pp. 9-17, Jan. 1981.
[17] J. Riordan, An Introduction to Combinatorial Analysis.Princeton, N.J.: Princeton Univ. Press, 1978.
[18] P.K. Srimani and R.L.N. Reddy, "Another Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 41, no. 1, pp. 51-57, Jan. 1992.
[19] I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Trans. Computer Systems, vol. 3, no. 4, pp. 344-349, Nov. 1985.
[20] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.
[21] S.M. Yuan and H.M. Chang, Comments on‘Availability ofk-Coterie’ IEEE Trans. Computers, vol. 43, no. 12, p. 1457, Dec. 1993.

Index Terms:
Mutual exclusion, fault-tolerance, distributed systems, replicated data.
Citation:
Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi, "Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 5, pp. 533-537, May 1997, doi:10.1109/71.598279
Usage of this product signifies your acceptance of the Terms of Use.