ACM Home Page
Please provide us with feedback. Feedback
A N algorithm for mutual exclusion in decentralized systems
Full text PdfPdf (1.02 MB)
Source ACM Transactions on Computer Systems (TOCS) archive
Volume 3 ,  Issue 2  (May 1985) table of contents
Pages: 145 - 159  
Year of Publication: 1985
ISSN:0734-2071
Author
Mamoru Maekawa  Department of Information Science, Faculty of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku Tokyo, 113 Japan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 51,   Downloads (12 Months): 247,   Citation Count: 129
Additional Information:

abstract   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/214438.214445
What is a DOI?

ABSTRACT

An algorithm is presented that uses only c√N messages to create mutual exclusion in a computer network, where N is the number of nodes and c a constant between 3 and 5. The algorithm is symmetric and allows fully parallel operation.


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
ALBERT, A. A., AND SANDLER, R. An Introduction to Finite Projective Planes. Holt, Rinehart, and Winston, New York, 1968.
 
2
CARVALHO, O. S. F., AND ROUCAIROL, G. On mutual exclusion in computer networks. Commun. ACM 26, 2 (Feb. 1983), 146-147.
3
 
4
GARCIA-MOLINA, H., AND BARBARA, D. How to assign votes in a distributed system. Tech. Rep. 311, Dept. of Electrical Engineering and Computer Science, Princeton Univ., Princeton, N.J., 1983.
5
6
 
7
LAMPORT, L. The implementation of reliable distributed multiprocess systems. Comput. Networks 2 (1978), 95-114.
8
9
 
10
SKEEN, D. A quorum-based commit protocol. In Proceedings o{ the 6th Berkeley Workshop on Distributed Data Management and Computer Networks (Feb. 1982), pp. 69-80.
11

CITED BY  129