Mamoru Maekawa
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.
- 1 ALBERT, A. A., AND SANDLER, R. An Introduction to Finite Projective Planes. Holt, Rinehart, and Winston, New York, 1968.Google Scholar
- 2 CARVALHO, O. S. F., AND ROUCAIROL, G. On mutual exclusion in computer networks. Commun. ACM 26, 2 (Feb. 1983), 146-147.Google Scholar
- 3 CHANG, E. J. H., AND ROBERTS, R. An improved algorithm for decentralized extrema-finding in circular configurations of processes. Comrnun. ACM 22, 5 (May 1979), 281-283. Google Scholar
- 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.Google Scholar
- 5 GIFFORD, D.K. Weighted voting for replicated data. In Proceedings of the 7th Symposium on Operating System Principles (Pacific Grove, Calif., Dec. 10-12), ACM, New York, 1979, pp. 150- 162. Google Scholar
- 6 HIRSCHBERG, D. S., AND SINCLAIR, J.B. Decentralized extrema-finding in ciruclar configurations of processors. Cornmun. ACM 23, 11 (Nov. 1980), 627-628. Google Scholar
- 7 LAMPORT, L. The implementation of reliable distributed multiprocess systems. Comput. Networks 2 (1978), 95-114.Google Scholar
- 8 RICART, G., AND AGRAWALA, A.K. An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24, 1 (Jan. 1981), 9-17. Google Scholar
- 9 SCHNEIDER, F.B. Synchronization in distributed programs. A CM Trans. Program. Lang. Syst. 4, 2 (Apr. 1982), 125-148. Google Scholar
- 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.Google Scholar
- 11 THOMAS, R. H. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst. 4, 2 (June 1979), 180-209. Google Scholar
Index Terms
- A √N algorithm for mutual exclusion in decentralized systems
Recommendations
Fair group mutual exclusion
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computingIn the group mutual exclusion problem [6], which generalizes mutual exclusion [2], a process chooses a session when it requests entry to the Critical Section. A group mutual exclusion algorithm must ensure that the mutual exclusion property holds: If ...
Space-efficient FCFS group mutual exclusion
In the group mutual exclusion problem [Y. Joung, Asynchronous group mutual exclusion, Distrib. Comput. 13 (2000) 189], which generalizes mutual exclusion [E. Dijkstra, Solution of a problem in concurrent programming control, Comm. ACM 8 (9) (1965) 569], ...
Group mutual exclusion in linear time and space
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingWe present two algorithms for the Group Mutual Exclusion (GME) Problem that satisfy the properties of Mutual Exclusion, Starvation Freedom, Bounded Exit, Concurrent Entry and First Come First Served. Both our algorithms use only simple read and write ...
Comments