The mutual exclusion problem
- 1 April 1986
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 33 (2) , 327-348
- https://doi.org/10.1145/5383.5385
Abstract
The theory developed in Part I is used to state the mutual exclusion problem and several additional fairness and failure-tolerance requirements. Four “distributed” N -process solutions are given, ranging from a solution requiring only one communication bit per process that permits individual starvation, to one requiring about N ! communication bits per process that satisfies every reasonable fairness and failure-tolerance requirement that we can conceive of.Keywords
This publication has 13 references indexed in Scilit:
- The mutual exclusion problemJournal of the ACM, 1986
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983
- Mutual exclusion with linear waiting using binary shared variablesACM SIGACT News, 1978
- Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering, 1977
- The synchronization of independent processesActa Informatica, 1976
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974
- Concurrent Programming ConceptsACM Computing Surveys, 1973
- Additional comments on a problem in concurrent programming controlCommunications of the ACM, 1966
- Solution of a problem in concurrent programming controlCommunications of the ACM, 1965