- 1 Courtois, P.J., Heymans, F., and Parnas, D.L. Concurrent control with "readers" and "writers." Comm. ACM 14, 10 (Oct. 1971), 667- 668. Google ScholarDigital Library
- 2 deBruijn, N.G. Additional comments on a problem in concurrent programming and control. Comm. ACM 10, 3 (March 1967), 137- 138. Google ScholarDigital Library
- 3 Dijkstra, E.W. Hierarchical ordering of sequential processes. Acta lnformatica 1, 2 (1971), 115-138.Google Scholar
- 4 Dijkstra, E.W. Solution of a problem in concurrent programming control Comm. ACM 8, 9 (Sept. 1965), 569. Google ScholarDigital Library
- 5 Dijkstra, E.W. The structure of the THE multiprogramming system. Comm. ACM 11, 5 (May 1968), 341-346. Google ScholarDigital Library
- 6 Eisenberg, M.A., and McGuire, M.R. Further comments on Dijkstra's concurrent programming control problem. Comm. A CM 15, 11 (Nov. 1972), 999. Google ScholarDigital Library
- 7 Hill, J. Carver. Synchronizing processors with memory-contentsgenerated interrupts. Comm. ACM 16, 6 (June 1973), 350-351. Google ScholarDigital Library
- 8 Knuth, D.E. Additional comments on a problem in concurrent programming control. Comm. ACM 9, 5 (May 1966), 321-322. Google ScholarDigital Library
- 9 Lamport, U A new solution of Dijkstra's concurrent programming problem. Comm. ACM 17, 8 (Aug. 1974), 453-455. Google ScholarDigital Library
- 10 Lamport, U Time, clocks and the ordering of events in a distributed system. Comm. A CM 21, 7 (July 1978), 558-565. Google ScholarDigital Library
- 11 Lamport, L. Time, clocks and the ordering of events in a distributed system. Rep. CA-7603-2911, Mass. Comptr. Assoc., Wakefield, Mass. March 1976.Google Scholar
- 12 Ricart, G., and Agrawala, A.K. Performance of a distributed network mutual exclusion algorithm. Tech. Rept. TR-774, Dept. Comptr. Sci., Univ. of Maryland, College Park, Md., March 1979.Google Scholar
- 13 Ricart, G., and Agrawala, A.K. Using exact timing to implement mutual exclusion in a distributed network. Tech. Rept. TR-742, Dept. Comptr. Sci., Univ. of Maryland, College Park, Md. March 1979.Google Scholar
Index Terms
An optimal algorithm for mutual exclusion in computer networks
Recommendations
A mutual exclusion algorithm with optimally bounded bypasses
Peterson's algorithm [G.L. Peterson, Myths about the mutual exclusion problem, Inform. Process. Lett. 12 (3) (1981) 115-116] for mutual exclusion has been widely studied for its elegance and simplicity. In Peterson's algorithm, each process has to cross ...
(h, k)-Arbiters for h-out-of-k mutual exclusion problem
h-Out-of-k mutual exclusion is a generalization of the 1-mutual exclusion problem, where there are k units of shared resources and each process requests h (1 ≤ h ≤ k) units at the same time. Though k-arbiter has been shown to be a quorum-based solution ...
On the family of critical section problems
A unified framework is proposed for mutual exclusion, mutual inclusion and such what we call critical section problem.Critical section problem is characterized by a pair of integers.The family of critical section problems is closed under complement ...
Comments