ACM Home Page
Please provide us with feedback. Feedback
The mutual exclusion problem: partII—statement and solutions
Full text PdfPdf (1.83 MB)
Source Journal of the ACM (JACM) archive
Volume 33 ,  Issue 2  (April 1986) table of contents
Pages: 327 - 348  
Year of Publication: 1986
ISSN:0004-5411
Author
Leslie Lamport  Digital Equipment Corp., Palo Alto, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 97,   Citation Count: 46
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/5383.5385
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
1a
2
3
 
4
FISCHER, M. J., LYNCH, N., BURNS, J. E., AND BORODIN, A. Resource allocation with immunity to limited processing failure. In Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science (Oct.). IEEE, New York, 1979, pp. 234-254.
5
6
7
 
8
LAMPORT, L. The synchronization of independent processes. Acta Inf. 7, 1 (1976), 15-34.
 
9
LAMPORT, L. Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE-3, 2 (Mar. 1977), 125-143.
 
10
LAMPORT, L. The implementation of reliable distributed multiprocess systems. Comput. Netw. 2 (1978), 95-114.
 
11
LAMPORT, L. The 'Hoare logic' of concurrent programs. Acta Inf. 14, l (1980), 21-37.
12
13
 
14
LAMPORT, L. What good is temporal logic? In Information Processing 83: Proceedings of the IFIP 9th World Congress (Paris, Sept. 19-23). R. E. A. Mason, Ed. North Holland, Amsterdam, 1983.
15
16
17
18
 
19
RAa}N, M. The choice coordination problem. Acta Inf. 17, (1982), 121-134.
 
20
RIVEST, R. L., AND PRATT, V. R. The mutual exclusion problem for unreliable processes: Preliminary report. In Proceedings of the IEEE Symposium on the Foundation of Computer Science. IEEE, New York, 1976, pp. 1-8.

CITED BY  46


REVIEW

"Neal Stanley Coulter : Reviewer","M. K. Solomon : Reviewer"

.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 so  more...