ACM Home Page
Please provide us with feedback. Feedback
An optimal algorithm for mutual exclusion in computer networks
Full text PdfPdf (752 KB)
Source
Communications of the ACM archive
Volume 24 ,  Issue 1  (January 1981) table of contents
Pages: 9 - 17  
Year of Publication: 1981
ISSN:0001-0782
Authors
Glenn Ricart  National Institute of Health, Bethesda, MD
Ashok K. Agrawala  Univ. of Maryland, College Park
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 63,   Downloads (12 Months): 288,   Citation Count: 96
Additional Information:

references   cited by   index terms   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/358527.358537
What is a DOI?

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
2
 
3
Dijkstra, E.W. Hierarchical ordering of sequential processes. Acta lnformatica 1, 2 (1971), 115-138.
4
5
6
7
8
9
10
 
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.
 
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.
 
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.

CITED BY  96

Collaborative Colleagues:
Glenn Ricart: colleagues
Ashok K. Agrawala: colleagues