A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
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 Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
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
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
| Hi-index | 0.00 |
A nonsymmetric deadlock-free mutual exclusion algorithm for computer networks is presented. The algorithm requires O(m) messages to synchronize m modes in a lightly loaded system, and the performance approaches a constant k dependent on m as the workload increases. In a medium to heavily loaded system, it outperforms other proposed algorithms and its performance is independent of network topology.