
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
G. Cao, M. Singhal, "A DelayOptimal QuorumBased Mutual Exclusion Algorithm for Distributed Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 12, pp. 12561268, December, 2001.  
BibTex  x  
@article{ 10.1109/71.970560, author = {G. Cao and M. Singhal}, title = {A DelayOptimal QuorumBased Mutual Exclusion Algorithm for Distributed Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {12}, issn = {10459219}, year = {2001}, pages = {12561268}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.970560}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A DelayOptimal QuorumBased Mutual Exclusion Algorithm for Distributed Systems IS  12 SN  10459219 SP1256 EP1268 EPD  12561268 A1  G. Cao, A1  M. Singhal, PY  2001 KW  Quorum KW  synchronization delay KW  distributed mutual exclusion KW  fault tolerance VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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 tradeoff in mutual exclusion algorithms. The Lamport algorithm and the RicartAgrawal 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 quorumbased 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 Maekawatype algorithms, they also suffer from the long synchronization delay. In this paper, we propose a delayoptimal quorumbased 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 FaultTolerant Solution for Distributed Mutual Exclusion ACM Trans. Computing Systems, vol. 9, no. 1, pp. 120, 1991.
[2] Y.I. Chang, “A Simulation Study on Distributed Mutual Exclusion,” J. Parallel and Distributed Computing, vol. 33, pp. 107121, 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. 289294, 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. 582592, 1992.
[5] A.W. Fu, “DelayOptimal Quorum Consensus for Distributed Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 1, pp. 5969, Jan. 1997.
[6] H. GarciaMolina and D. Barbara, “How to Assign Votes in a Distributed System,” J. ACM, vol. 32, no. 4, pp. 841860, Oct. 1985.
[7] J. Helary, A. Mostefaoui, and M. Raynal, “A General Scheme for Token and TreeBased Distributed Mutual Exclusion Algorithms,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 11, pp. 11851196, Nov. 1994.
[8] A. Kumar, “Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data,” IEEE Trans. Computers, vol. 40, no. 9, pp. 9961,004, Sept. 1991.
[9] Y.C. Kuo and S.T. Huang, A Geometric Approach for Constructing Coteries andkCoteries IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 402411, Apr. 1997.
[10] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558565, 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. 537549, 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. 145159, 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. 187202, 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. 371375, 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. 9299, 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. 120129, 1997.
[18] S. Rangarajan, S. Setia, and S.K. Tripathi, "A Faulttolerant Algorithm for Replicated Data Management," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 12, pp. 1,2711,282, Dec. 1995.
[19] K. Raymond, “A TreeBased Algorithm for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 7, no. 1, pp. 6177, 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. 917, Jan. 1981.
[21] M. Singhal, “A Class of DeadlockFree MaekawaType Algorithms for Mutual Exclusion in Distributed Systems,” Distributed Computing, vol. 4, pp. 131138, 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. 121125, Jan. 1992.
[23] M. Singhal,“A taxonomy of distributed mutual exclusion,” J. Parallel and Distributed Computing, vol. 15, pp. 94101, May, 1993.
[24] I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Trans. Computer Systems, vol. 3, no. 4, pp. 344349, Nov. 1985.
[25] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180209, June 1979.
[26] T. Tsuchiya, M. Yamaguchi, and T. Kikuno, “Minimizing the Maximum Delay for Reaching Consensus in QuorumBased Mutual Exclusion Schemes,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 4, Apr. 1999.