Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Fischer, N. Lynch, J. Burns, A. Borodin (1979)
Resource allocation with immunity to limited process failure20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
E. Dijkstra (1974)
Self-stabilizing systems in spite of distributed controlCommun. ACM, 17
(1980)
RECEIVED DECEMBER REVISED SEPTEMBER
G. Graham
A New Solution of Dijkstra ' s Concurrent Programming Problem
L. Lamport (1977)
Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering, SE-3
P. Hansen (1973)
Concurrent Programming ConceptsACM Comput. Surv., 5
L. Lamport (1986)
The mutual exclusion problem: part I—a theory of interprocess communicationJ. ACM, 33
G. Peterson, M. Fischer (1977)
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
A solution to the critical section problem with a totally wait-free fifo doorway. 1978. Internal Memorandum
L. Lamport (1983)
Reasoning about nonatomic operations
P. Ingerman (1967)
Format effectors in ISO7 and ASCIICommun. ACM, 10
E. Dijkstra (1965)
Solution of a problem in concurrent programming control
L. Lamport (1978)
The Implementation of Reliable Distributed Multiprocess SystemsComput. Networks, 2
L. Lamport (1983)
What Good is Temporal Logic?
J. Burns (1978)
Mutual exclusion with linear waiting using binary shared variablesSIGACT News, 10
R. Rivest, V. Pratt (1976)
The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report
S. Owicki, L. Lamport (1982)
Proving Liveness Properties of Concurrent ProgramsACM Trans. Program. Lang. Syst., 4
(1961)
Journal of the Association for Computing MachineryNature, 190
Donald Knuth (1966)
Additional comments on a problem in concurrent programming controlCommun. ACM, 9
H. Katseff (1978)
A new solution to the critical section problemProceedings of the tenth annual ACM symposium on Theory of computing
L. Lamport (1983)
Specifying Concurrent Program ModulesACM Trans. Program. Lang. Syst., 5
G. Peterson (1983)
A New Solution to Lamport's Concurrent Programming Problem Using Small Shared VariablesACM Trans. Program. Lang. Syst., 5
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.
Journal of the ACM (JACM) – Association for Computing Machinery
Published: Apr 1, 1986
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.