The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
Time bounds for mutual exclusion and related problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A simulation study on distributed mutual exclusion
Journal of Parallel and Distributed Computing
A fast token-chasing mutual exclusion algorithm in arbitrary network topologies
Journal of Parallel and Distributed Computing
A log (N) distributed mutual exclusion algorithm based on path reversal
Journal of Parallel and Distributed Computing
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Communications of the ACM
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Mobile Agent Enabled Fully Distributed Mutual Exclusion Algorithm
MA '02 Proceedings of the 6th International Conference on Mobile Agents
Mutual exclusion in asynchronous systems with failure detectors
Journal of Parallel and Distributed Computing
A new robust centralized DMX algorithm
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Performance of fair distributed mutual exclusion algorithms
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Fault tolerant and robust mutual exclusion protocol for synchronous distributed systems
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Info-based approach in distributed mutual exclusion algorithms
Journal of Parallel and Distributed Computing
A gossip-based mutual exclusion algorithm for cloud environments
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems
Journal of Network and Systems Management
Quorum-based mutual exclusion in asynchronous distributed systems with unreliable failure detectors
The Journal of Supercomputing
| Hi-index | 0.00 |
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.