This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
December 2001 (vol. 12 no. 12)
pp. 1256-1268

The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay trade-off in mutual exclusion algorithms. The Lamport algorithm and the Ricart-Agrawal algorithm both have a synchronization delay of T (T is the average message delay), but their message complexity is O(N). Maekawa's algorithm reduces the message complexity to O(\sqrt{N}); however, it increases the synchronization delay to 2T. After Maekawa's algorithm, many quorum-based mutual exclusion algorithms have been proposed to reduce the message complexity or the increase the resiliency to site and communication link failures. Since these algorithms are Maekawa-type algorithms, they also suffer from the long synchronization delay. In this paper, we propose a delay-optimal quorum-based mutual exclusion algorithm which reduces the synchronization delay to T and still has a low message complexity of O(K) (K is the size of the quorum which can be as low as \log N). A correctness proof and a detailed performance analysis are provided.

[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] Y.-I. Chang, “A Simulation Study on Distributed Mutual Exclusion,” J. Parallel and Distributed Computing, vol. 33, pp. 107-121, 1996.
[3] Y.-I. Chang, M. Singhal, and M. Liu, “A Hybrid Approach to Mutual Exclusion for Distributed Systems,” Proc. Ann. Int'l Computer Software and Application Conf., pp. 289-294, Oct. 1990.
[4] 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.
[5] A.W. Fu, “Delay-Optimal Quorum Consensus for Distributed Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 1, pp. 59-69, Jan. 1997.
[6] 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.
[7] J. Helary, A. Mostefaoui, and M. Raynal, “A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 11, pp. 1185-1196, Nov. 1994.
[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] Y.C. Kuo and S.T. Huang, A Geometric Approach for Constructing Coteries andk-Coteries IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 402-411, Apr. 1997.
[10] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[11] S. Lodha and A. Kshemkalyani, “A Fair Distributed Mutual Exclusion Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 6, pp. 537-549, June 2000.
[12] W.-S. Luk and T.-T. Wong, “Two New Quorum Based Algorithms for Distributed Mutual Exclusion,” Proc. 17th Int'l Conf. Distributed Computing Systems, May 1997.
[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] D. Malkhi and M. Reiter, “An Architecture for Survivable Coordination in Large Distributed Systems,” IEEE Trans. Knowledge and Data Eng., vol. 12, no. 2, pp. 187-202, Mar./Apr. 2000.
[15] M. Naimi and M. Trehel, “An Improvement of the Log(n) Distributed Algorithm for Mutual Exclusion,” Proc. Seventh Int'l Conf. Distributed Computing System, pp. 371-375, 1987.
[16] W.K. Ng and C.V. Ravishankar, “Coterie Templates: A New Quorum Construction Method,” Proc. 15th Int'l Conf. Distributed Computing Systems, pp. 92-99, May 1995.
[17] D. Peleg and A. Wool, “Crumbling Walls: A Class of Practical and Efficient Quorum Systems,” Distributed Computing, vol. 10, no. 2, pp. 120-129, 1997.
[18] S. Rangarajan, S. Setia, and S.K. Tripathi, "A Fault-tolerant Algorithm for Replicated Data Management," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 12, pp. 1,271-1,282, Dec. 1995.
[19] K. Raymond, “A Tree-Based Algorithm for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 7, no. 1, pp. 61-77, Feb. 1989.
[20] 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.
[21] M. Singhal, “A Class of Deadlock-Free Maekawa-Type Algorithms for Mutual Exclusion in Distributed Systems,” Distributed Computing, vol. 4, pp. 131-138, Feb. 1991.
[22] M. Singhal, “A Dynamic Information Structure Mutual Exclusion Algorithm for Distributed Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 1, pp. 121-125, Jan. 1992.
[23] M. Singhal,“A taxonomy of distributed mutual exclusion,” J. Parallel and Distributed Computing, vol. 15, pp. 94-101, May, 1993.
[24] I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Trans. Computer Systems, vol. 3, no. 4, pp. 344-349, Nov. 1985.
[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] T. Tsuchiya, M. Yamaguchi, and T. Kikuno, “Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 4, Apr. 1999.

Index Terms:
Quorum, synchronization delay, distributed mutual exclusion, fault tolerance
Citation:
G. Cao, M. Singhal, "A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 12, pp. 1256-1268, Dec. 2001, doi:10.1109/71.970560
Usage of this product signifies your acceptance of the Terms of Use.