- [1] G.L. Peterson, Myths About the Mutual Exclusion Problem, Inf. Proc. Lett. 12 #3, 115-116 (1981).Google ScholarCross Ref
- [2] M. Raynal, Algorithms for Mutual Exclusion, North Oxford Academic Pub. (1986). Google ScholarDigital Library
Index Terms
- Proof of a mutual exclusion algorithm—a classic example
Recommendations
Fair group mutual exclusion
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computingIn the group mutual exclusion problem [6], which generalizes mutual exclusion [2], a process chooses a session when it requests entry to the Critical Section. A group mutual exclusion algorithm must ensure that the mutual exclusion property holds: If ...
Space-efficient FCFS group mutual exclusion
In the group mutual exclusion problem [Y. Joung, Asynchronous group mutual exclusion, Distrib. Comput. 13 (2000) 189], which generalizes mutual exclusion [E. Dijkstra, Solution of a problem in concurrent programming control, Comm. ACM 8 (9) (1965) 569], ...
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract
PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computingMutual exclusion is a fundamental coordination problem. Over the last 20 years, shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references (RMRs) metric.
To ensure the correctness of concurrent ...
Comments