(Enter summary)
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.
Contents
1 Introduction 3
2 The... (Update)
Cited by: More
Group Coordination Support in Networked Multimedia Systems - Dommel (1999)
(Correct)
How to Make a Correct Multiprocess Program Execute Correctly on a .. - Lamport (1996)
(Correct)
Extending the REpresentational State Transfer (REST).. - Khare, Taylor (2003)
(Correct)
Active bibliography (related documents): More All
1.2: The Mutual Exclusion Problem - Part II: Statement and Solutions - Lamport (2000)
(Correct)
0.4: Distributed FIFO Allocation of Identical Resources.. - Fischer, Lynch.. (1989)
(Correct)
0.3: The Mutual Exclusion Problem - Part I: A Theory of Interprocess.. - Lamport (2000)
(Correct)
Similar documents based on text: More All
0.6: Shared-memory Mutual Exclusion: Major Research Trends Since 1986 - Anderson, Kim (2001)
(Correct)
0.1: Planning Reliable UMTS Terrestrial Access Networks - Attila Szlove Ncsak
(Correct)
0.0: Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free.. - Anderson, Moir (1997)
(Correct)
Related documents from co-citation: More All
18: Self-stabilizing systems in spite of distributed control (context) - Dijkstra - 1974
14: The mutual exclusion problem: Part I -- a theory of interprocess communication
- Lamport - 1986
11: A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974
BibTeX entry: (Update)
L. Lamport, "The Mutual Exclusion Problem: Part II - Statement and Solutions", Journal of the Association for Computing Machinery , Vol. 33 No. 2 (1986), pp. 327348. http://citeseer.ist.psu.edu/article/lamport00mutual.html More
@article{ lamport86mutual,
author = "Leslie Lamport",
title = "The Mutual Exclusion Problem: {Part {II}} --- Statement and Solutions",
journal = "Journal of the ACM",
volume = "33",
number = "2",
pages = "327--348",
year = "1986",
url = "citeseer.ist.psu.edu/article/lamport00mutual.html" }
Citations (may not include all citations):
625
ACM Transactions on Programming Languages and Systems (context) - Lamport, program - 1983
340
Self-stabilizing systems in spite of distributed control (context) - Dijkstra - 1974
160
What good is temporal logic (context) - Lamport - 1983
157
Proving the correctness of multiprocess programs (context) - Lamport - 1977
142
Solution of a problem in concurrent programming control (context) - Dijkstra - 1965
107
A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974
104
Proving liveness properties of concurrent programs (context) - Owicki, Lamport - 1982
65
Hoare logic (context) - Lamport - 1980
44
The mutual exclusion problem---part i: a theory of interproc..
- Lamport
39
The implementation of reliable distributed multiprocess syst.. (context) - Lamport - 1978
33
Economical solutions for the critical section problem in a d.. (context) - Peterson, Fischer - 1977
28
The choice coordination problem (context) - Rabin - 1982
23
Resource Allocation with Immunity to Limited Process Failure
- Fischer - 1979
17
Concurrent programming concepts (context) - Hansen - 1973
12
A new solution to lamport's concurrent programming problem (context) - Peterson - 1983
12
Reasoning about nonatomic operations (context) - Lamport - 1983
7
The synchronization of independent processes (context) - Lamport - 1976
5
The mutual exclusion problem for unreliable processes: preli.. (context) - Rivest, Pratt - 1976
4
Additional commments on a problem in concurrent program cont.. (context) - Knuth - 1966
4
A solution to the critical section problem with a totally wa.. (context) - Katse - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://research.compaq.com/SRC/personal/lamport/pubs/pubs.html): More
Recursive Compiling and Programming Environments - Lamport (1984)
(Correct)
A Formal Basis for the Specification of Concurrent Systems - Lamport (2000)
(Correct)
Control Predicates are Better than Dummy Variables for Reasoning.. - Lamport (1987)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC