This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
February 1997 (vol. 46 no. 2)
pp. 222-228

Abstract—We propose a structure named Cohorts to solve the problem of the access control of multiple entries to a critical section. Our solution is formalized as forming quorums in a k-coterie. It is resilient to node failures and/or network partitioning, invokes constant expected message cost and has comparably high availability.

[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.B. Davidson, H. Garcia-Molina, and D. Skeen, "Consistency in Partitioned Networks," ACM Computing Surveys, vol. 17, no. 3, pp. 341-370, Sept. 1985.
[3] J.A. Dossey, A.D. Otto, L.E. Spence, and C.V. Eynden, Discrete Mathematics. Scott, Foresman and Company, 1986.
[4] S. Fujita, M. Yamashita, and T. Ae, "Distributed k-Mutual Exclusion Problem and k-Coteries," Proc. Symp. Algorithms, pp. 22-31, 1991.
[5] 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.
[6] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150-159, Dec. 1979.
[7] J.M. Helary, N. Plouzeau, and M. Raynal, "A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network," Computer J. vol. 31, no. 4, pp. 289-295, 1988.
[8] 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.
[9] H. Kakugawa, S. Fujita, M. Yamashita, T. Ae, Availability ofk-Coterie IEEE Trans. Computers, vol. 42, no. 5, pp. 553-558, May 1993.
[10] H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae, “A Distributedk-Mutual Exclusion Algorithm Usingk-Coterie,” Information Processing Letters, vol. 49, no. 4, pp. 213-218, Feb. 1994.
[11] 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.
[12] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[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] J. Misra,“Detecting termination of distributed computations using markers,”inACM Symp. Principles Distrib. Comput., Aug. 1983, pp. 290–294.
[15] K. Raymond, “A Tree-Based Algorithm for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 7, no. 1, pp. 61-77, Feb. 1989.
[16] K. Raymond, "A Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 30, no. 4, pp. 189-193, Feb. 1989.
[17] 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.
[18] D. Shou and S.D. Wang, "An Efficient Quorum Generating Approach for Distributed Mutual Exclusion," J. Information Science and Eng., vol. 9, pp. 201-227, June 1993.
[19] M. Singhal, “A Heuristically Aided Algorithm for Mutual Exclusion in Distributed Systems,” IEEE Trans. Computers, vol. 38, no. 5, pp. 651-662, May 1989.
[20] 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.
[21] I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Trans. Computer Systems, vol. 3, no. 4, pp. 344-349, Nov. 1985.
[22] 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:
Availability, coteries, distributed systems, fault-tolerance, mutual exclusion, quorums.
Citation:
Jehn-Ruey Jiang, Shing-Tsaan Huang, Yu-Chen Kuo, "Cohorts Structures for Fault-Tolerant k Entries to a Critical Section," IEEE Transactions on Computers, vol. 46, no. 2, pp. 222-228, Feb. 1997, doi:10.1109/12.565603
Usage of this product signifies your acceptance of the Terms of Use.