This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Geometric Approach for Constructing Coteries and k-Coteries
April 1997 (vol. 8 no. 4)
pp. 402-411

Abstract—Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. Recently, some mutual exclusion algorithms successfully use logical structures to construct coteries with small quorums sizes. In this paper, we introduce a geometric approach on dealing with the logical structures and present some useful geometric properties for constructing coteries and k-coteries. Based on those geometric properties, a logical structure named three-sided graph is proposed to provide a new scheme for constructing coteries with small quorums: The smallest quorum size is $O(\sqrt N)$ in a homogeneous system with N nodes and O(1) in a heterogeneous system. In addition, we also extend the three-sided graph to the n-sided graph for constructing k-coteries.

[1] 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.
[2] S.Y. Cheung, M.H. Ammar, and M. Ahamad, "The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data," IEEE Trans. Knowledge and Data Eng., vol. 4, no. 6, pp. 582-592, 1992.
[3] H. Chen and J. Tang, "An Efficient Method for Mutual Exclusion in Truly Distributed Systems," Proc. 14th IEEE Int'l Conf. Distributed Computing Systems, pp. 97-104, June 1994.
[4] 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.
[5] E. Horowitz and S. Sahni, Fundamentals of Data Structures in Pascal. Rockville, Md.: Computer Science Press, 1989.
[6] 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.
[7] H. Kakugawa, S. Fujita, M. Yamashita, T. Ae, Availability ofk-Coterie IEEE Trans. Computers, vol. 42, no. 5, pp. 553-558, May 1993.
[8] 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.
[9] 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.
[10] K. Raymond, "A Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 30, no. 4, pp. 189-193, Feb. 1989.
[11] 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.
[12] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.

Index Terms:
Coterie, critical section, distributed algorithm, fault-tolerance, mutual exclusion, quorum set.
Citation:
Yu-Chen Kuo, Shing-Tsaan Huang, "A Geometric Approach for Constructing Coteries and k-Coteries," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 4, pp. 402-411, April 1997, doi:10.1109/71.588618
Usage of this product signifies your acceptance of the Terms of Use.