The Mutual Exclusion Problem: Part II—Statement and Solutions

Journal of the ACM (JACM)

Volumn 33, Issue 2, 1986, Pages 327-348

  Lamport, Leslie ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

Critical section; shared variables

Indexed keywords

COMPUTER OPERATING SYSTEMS;

FAULT-TOLERANCE; MUTUAL EXCLUSION PROBLEM; SYNCHRONIZATION;

COMPUTER SYSTEMS, DIGITAL;

EID: 0022698004     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/5383.5385     Document Type: Article

References (21)

1. Brinch Hansen, P. Concurrent programming concepts. ACM Comput. Surv. 5 (1973), 223-245.
2. Burns, J. Mutual exclusion with linear waiting using binary shared variables. ACM SIGACT News (Summer 1978), 42-47.
3. Dijkstra, E. W. Solution of a problem in concurrent programming control. Commun. ACM 8, 9 (Sept. 1965), 569.
4. Dijkstra, E. W. Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 11 (Nov. 1974), 643-644.
5. 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.
6. Katseff, H. P. A new solution to the critical section problem. In Conference Record of the 10th Annual ACM Symposium on the Theory of Computing (San Diego, Calif., May 1-3). ACM, New York, 1978, pp. 86–88.
7. Knuth, D. E. Additional comments on a problem in concurrent program control. Commun. ACM 9, 5 (May 1966), 321-322.
8. Lamport, L. A new solution of Dijkstra’s concurrent programming problem. Commun. ACM 17, 8 (Aug. 1974), 453-455.
9. Lamport, L. The synchronization of independent processes. Acta Inf. 7, 1 (1976), 15-34.
10. Lamport, L. Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE-3, 2 (Mar. 1977), 125-143.
11. Lamport, L. The implementation of reliable distributed multiprocess systems. Comput. Netw. 2 (1978), 95-114.
12. Lamport, L. The ‘Hoare logic’ of concurrent programs. Acta Inf. 14, 1 (1980), 21-37.
13. Lamport, L. Reasoning about nonatomic operations. In Proceedings of the 10th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (Austin, Tex., Jan. 24-26). ACM, New York, 1983, pp. 28–37.
14. Lamport, L. Specifying concurrent program modules. ACM Trans. Program. Lang. Syst. 5, 2 (Apr. 1983), 190-222.
15. 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.
16. Lamport, L. The mutual exclusion problem: Part I—A theory of interprocess communication. J. ACM 33, 2 (Apr. 1986), 313-326.
17. Owicki, S., and Lamport, L. Proving liveness properties of concurrent programs. ACM Trans. Program. Lang. Syst. 4, 3 (July 1982), 455-495.
18. Peterson, G. L. A new solution to Lamport’s concurrent programming problem. ACM Trans. Program. Lang. Syst. 5, 1 (Jan. 1983), 56-65.
19. Peterson, G., and Fischer, M. Economical solutions to the critical section problem in a distributed system. In Proceedings of the 9th Annual ACM Symposium on the Theory of Computing (Boulder, Colo., May 2-4). ACM New York, 1977, pp. 91–97.
20. Rabin, M. The choice coordination problem. Acta Inf. 17, (1982), 121-134.
21. 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.