Algorithms for mutual exclusion
Algorithms for mutual exclusion
Principles of concurrent and distributed programming
Principles of concurrent and distributed programming
About logical clocks for distributed systems
ACM SIGOPS Operating Systems Review
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of 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
Communicating sequential processes
Communications of the ACM
Distributed Algorithms
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Quorum-Based Algorithms for Group Mutual Exclusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Token Based Group Mutual Exclusion for Asynchronous Rings (Extended Abstract)
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
The design issues for asynchronous group mutual exclusion have been modeled as the Congenial Talking Philosophers, and solutions for shared-memory models have been proposed [4]. This paper presents an efficient and highly concurrent distributed algorithm for computer networks where processes communicate by message passing.