Publication 2000 Issue No. 6 - June Abstract - A Fair Distributed Mutual Exclusion Algorithm
A Fair Distributed Mutual Exclusion Algorithm
June 2000 (vol. 11 no. 6)
pp. 537-549
 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. 537-549, 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 = {1045-9219},year = {2000},pages = {537-549},doi = {http://doi.ieeecomputersociety.org/10.1109/71.862205},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - A Fair Distributed Mutual Exclusion AlgorithmIS - 6SN - 1045-9219SP537EP549EPD - 537-549A1 - Sandeep Lodha, A1 - Ajay Kshemkalyani, PY - 2000KW - AlgorithmKW - concurrencyKW - distributed systemKW - fairnessKW - mutual exclusionKW - synchronization.VL - 11JA - IEEE Transactions on Parallel and Distributed SystemsER -

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.

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