| A N algorithm for mutual exclusion in decentralized systems |
| Full text |
Pdf
(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 |
|
| Bibliometrics |
Downloads (6 Weeks): 35, Downloads (12 Months): 318, Citation Count: 127
|
|
|
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 127
|
|
|
|
|
|
|
|
|
|
|
Harry Buhrman , Matthew Franklin , Juan A. Garay , Jaap-Henk Hoepman , John Tromp , Paul Vitányi, Mutual search, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.481-489, January 25-27, 1998, San Francisco, California, United States
|
|
|
Dahlia Malkhi , Michael Reiter , Rebecca Wright, Probabilistic quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.267-273, August 21-24, 1997, Santa Barbara, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Harry Buhrman , Matthew Franklin , Juan A. Garay , Jaap-Henk Hoepman , John Tromp , Paul Vitányi, Mutual search, Journal of the ACM (JACM), v.46 n.4, p.517-536, July 1999
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
David Peleg , Avishai Wool, How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract), Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.290-299, May 23-26, 1996, Philadelphia, Pennsylvania, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Dahlia Malkhi , Michael Reiter , Avishai Wool, The load and availability of Byzantine quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.249-257, August 21-24, 1997, Santa Barbara, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ravi Prakash , Niranjan G. Shivaratri , Mukesh Singhal, Distributed dynamic channel allocation for mobile computing, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, p.47-56, August 20-23, 1995, Ottowa, Ontario, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
G. Manimaran , Shashidhar Merugu , Anand Manikutty , C. Siva Ram Murthy, Integrated scheduling of tasks and messages in distributed real-time systems, Engineering of distributed control systems, Nova Science Publishers, Inc., Commack, NY, 2001
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Anupam Gupta , Bruce M. Maggs , Florian Oprea , Michael K. Reiter, Quorum placement in networks to minimize access delays, Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, July 17-20, 2005, Las Vegas, NV, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Daniel Golovin , Anupam Gupta , Bruce M. Maggs , Florian Oprea , Michael K. Reiter, Quorum placement in networks: minimizing network congestion, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, July 23-26, 2006, Denver, Colorado, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yong Wang , Chieh-Yih Wan , Margaret Martonosi , Li-Shiuan Peh, Transport layer approaches for improving idle energy in challenged sensor networks, Proceedings of the 2006 SIGCOMM workshop on Challenged networks, p.253-260, September 11-15, 2006, Pisa, Italy
|
|
|
Moharram Challenger , Vahid Khalilpour , Peyman Bayat , Mohammad Reza Meibodi, A new robust centralized DMX algorithm, Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks, p.367-374, February 13-15, 2007, Innsbruck, Austria
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|