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)
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
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
| Hi-index | 0.00 |
A non-symmetric algorithm is presented that achieves mutual exclusion in a decentralized computer network by exchanging messages and a synchronization queue. The algorithm is unique in the sense that the number of messages required to achieve mutual exclusion is a function of the workload enabling it to provide acceptable performance in a lightly loaded system with a significant improvement as the workload increases. The algorithm outperforms other previously proposed algorithms in a heavily loaded system, is robust and comparatively easy to implement.