
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sandeep Lodha, Ajay Kshemkalyani, "A Fair Distributed Mutual Exclusion Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 6, pp. 537549, June, 2000.  
BibTex  x  
@article{ 10.1109/71.862205, author = {Sandeep Lodha and Ajay Kshemkalyani}, title = {A Fair Distributed Mutual Exclusion Algorithm}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {11}, number = {6}, issn = {10459219}, year = {2000}, pages = {537549}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.862205}, 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 Fair Distributed Mutual Exclusion Algorithm IS  6 SN  10459219 SP537 EP549 EPD  537549 A1  Sandeep Lodha, A1  Ajay Kshemkalyani, PY  2000 KW  Algorithm KW  concurrency KW  distributed system KW  fairness KW  mutual exclusion KW  synchronization. VL  11 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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
[1] O. Carvalho and G. Roucairol, “On Mutual Exclusion in Computer Networks, Technical Correspondence,” Comm. ACM, vol. 26, no. 2, pp. 146147, Feb. 1983.
[2] Y.I. Chang, “A Simulation Study on Distributed Mutual Exclusion,” J. Parallel and Distributed Computing, vol. 33, pp. 107121, 1996.
[3] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558565, July 1978.
[4] M. Maekawa, “A$\sqrt N $Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145159, 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. 113, 1996.
[6] K. Raymond, “A TreeBased Algorithm for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 7, no. 1, pp. 6177, 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. 917, Jan. 1981.
[8] B. Sanders, “The Information Structure of Distributed Mutual Exclusion Algorithms,” ACM Trans. Computer Systems, vol. 5, no. 3, pp. 284299, Aug. 1987.
[9] M. Singhal,“A taxonomy of distributed mutual exclusion,” J. Parallel and Distributed Computing, vol. 15, pp. 94101, 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. 121125, Jan. 1992.
[11] M. Singhal, “A Heuristically Aided Algorithm for Mutual Exclusion in Distributed Systems,” IEEE Trans. Computers, vol. 38, no. 5, pp. 651662, May 1989.
[12] I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Trans. Computer Systems, vol. 3, no. 4, pp. 344349, Nov. 1985.
[13] Y. Yan, X. Zhang, and H. Yang, “A Fast TokenChasing Mutual Exclusion Algorithm in Arbitrary Network Topologies,” J. Parallel and Distributed Computing, vol. 35, pp. 156172, 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. 224233, May 1994.
[15] J.H. Yang, J. Anderson, “A Fast, Scalable Mutual Exclusion Algorithm,” Distributed Computing vol. 9, no. 1, pp. 5160, Aug. 1995.