This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Fair Distributed Mutual Exclusion Algorithm
June 2000 (vol. 11 no. 6)
pp. 537-549

Abstract—This paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between $N-1$ and $2(N-1)$ messages per critical section access, where $N$ is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the computation. The algorithm does not introduce any other overheads over Lamport's and Ricart-Agrawala's algorithms, which require $3(N-1)$ and $2(N-1)$ messages, respectively, per critical section access and are the only other decentralized algorithms that allow mutual exclusion access in the order of the timestamps of requests.

[1] O. Carvalho and G. Roucairol, “On Mutual Exclusion in Computer Networks, Technical Correspondence,” Comm. ACM, vol. 26, no. 2, pp. 146-147, Feb. 1983.
[2] Y.-I. Chang, “A Simulation Study on Distributed Mutual Exclusion,” J. Parallel and Distributed Computing, vol. 33, pp. 107-121, 1996.
[3] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[4] 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.
[5] M. Naimi, M. Trehel, and A. Arnold, “A$\log(n)$Distributed Mutual Exclusion Algorithm Based on Path Reversal,” J. Parallel and Distributed Computing, vol. 34, pp. 1-13, 1996.
[6] K. Raymond, “A Tree-Based Algorithm for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 7, no. 1, pp. 61-77, Feb. 1989.
[7] 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.
[8] B. Sanders, “The Information Structure of Distributed Mutual Exclusion Algorithms,” ACM Trans. Computer Systems, vol. 5, no. 3, pp. 284-299, Aug. 1987.
[9] M. Singhal,“A taxonomy of distributed mutual exclusion,” J. Parallel and Distributed Computing, vol. 15, pp. 94-101, May, 1993.
[10] 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.
[11] M. Singhal, “A Heuristically Aided Algorithm for Mutual Exclusion in Distributed Systems,” IEEE Trans. Computers, vol. 38, no. 5, pp. 651-662, May 1989.
[12] I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Trans. Computer Systems, vol. 3, no. 4, pp. 344-349, Nov. 1985.
[13] Y. Yan, X. Zhang, and H. Yang, “A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network Topologies,” J. Parallel and Distributed Computing, vol. 35, pp. 156-172, 1996.
[14] J.-H. Yang and J. Anderson, “Time Bounds for Mutual Exclusion and Related Problems,” Proc. 26th Ann. ACM Symp. Theory of Computing, pp. 224-233, May 1994.
[15] J.-H. Yang, J. Anderson, “A Fast, Scalable Mutual Exclusion Algorithm,” Distributed Computing vol. 9, no. 1, pp. 51-60, Aug. 1995.

Index Terms:
Algorithm, concurrency, distributed system, fairness, mutual exclusion, synchronization.
Citation:
Sandeep Lodha, Ajay Kshemkalyani, "A Fair Distributed Mutual Exclusion Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 6, pp. 537-549, June 2000, doi:10.1109/71.862205
Usage of this product signifies your acceptance of the Terms of Use.