article

Free access

A √N algorithm for mutual exclusion in decentralized systems

Editor: Anita K. Jones Author:

Mamoru MaekawaAuthors Info & Claims

ACM Transactions on Computer Systems (TOCS), Volume 3, Issue 2

Pages 145 - 159

https://doi.org/10.1145/214438.214445

Published: 01 May 1985 Publication History

PDF eReader

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

[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.

Crossref

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.

Crossref

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.

Crossref

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.

Crossref

Google Scholar

[9]

SCHNEIDER, F.B. Synchronization in distributed programs. A CM Trans. Program. Lang. Syst. 4, 2 (Apr. 1982), 125-148.

Crossref

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.

Crossref

Google Scholar

Cited By

View all

Jin CNogler J(2024)Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch MatchingACM Transactions on Algorithms10.1145/367239520:4(1-36)Online publication date: 5-Aug-2024
https://dl.acm.org/doi/10.1145/3672395
Chaurasia BVerma AVerma P(2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks10.1016/j.comnet.2024.110432247(110432)Online publication date: Jun-2024
https://doi.org/10.1016/j.comnet.2024.110432
Rabhi MDi Pietro R(2024)An efficient failure-resilient mutual exclusion algorithm for distributed systems leveraging a novel zero-message overlay structureComputer Communications10.1016/j.comcom.2024.02.007218(1-13)Online publication date: Mar-2024
https://doi.org/10.1016/j.comcom.2024.02.007
Show More Cited By

Index Terms

A √N algorithm for mutual exclusion in decentralized systems
1. Networks
  1. Network protocols
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Mutual exclusion

Recommendations

Fair group mutual exclusion
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing

In 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 Networking

We 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

Information & Contributors

Information

Published In

cover image ACM Transactions on Computer Systems

ACM Transactions on Computer Systems Volume 3, Issue 2

May 1985

83 pages

ISSN:0734-2071

EISSN:1557-7333

DOI:10.1145/214438

Editor:
Anita K. Jones

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1985

Published in TOCS Volume 3, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

596
Total Citations
View Citations
5,492
Total Downloads

Downloads (Last 12 months)522
Downloads (Last 6 weeks)33

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jin CNogler J(2024)Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch MatchingACM Transactions on Algorithms10.1145/367239520:4(1-36)Online publication date: 5-Aug-2024
https://dl.acm.org/doi/10.1145/3672395
Chaurasia BVerma AVerma P(2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks10.1016/j.comnet.2024.110432247(110432)Online publication date: Jun-2024
https://doi.org/10.1016/j.comnet.2024.110432
Rabhi MDi Pietro R(2024)An efficient failure-resilient mutual exclusion algorithm for distributed systems leveraging a novel zero-message overlay structureComputer Communications10.1016/j.comcom.2024.02.007218(1-13)Online publication date: Mar-2024
https://doi.org/10.1016/j.comcom.2024.02.007
Saleh EShastry C(2024)Simulation and Modelling of Task Migration in Distributed Systems Using SimGridModeling, Simulation and Optimization10.1007/978-981-99-6866-4_36(475-486)Online publication date: 20-Feb-2024
https://doi.org/10.1007/978-981-99-6866-4_36
Ayad LLoukides GPissis S(2023)Text Indexing for Long Patterns: Anchors are All you NeedProceedings of the VLDB Endowment10.14778/3598581.359858616:9(2117-2131)Online publication date: 1-May-2023
https://dl.acm.org/doi/10.14778/3598581.3598586
Akmal SJin C(2023)Near-Optimal Quantum Algorithms for String ProblemsAlgorithmica10.1007/s00453-022-01092-x85:8(2260-2317)Online publication date: 27-Jan-2023
https://dl.acm.org/doi/10.1007/s00453-022-01092-x
Kranakis EVitányi P(2023)A note on weighted distributed match-makingMathematical Systems Theory10.1007/BF0283583225:2(123-140)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF02835832
Lan HLiu GWang WLiang CMa Z(2023)Three‐dimensional scan‐based algorithm for directional neighbor discovery in ad hoc networksInternational Journal of Communication Systems10.1002/dac.549636:10Online publication date: 19-May-2023
https://doi.org/10.1002/dac.5496
Ghosh RGhosh H(2023)Mutual ExclusionDistributed Systems10.1002/9781119825968.ch8(189-217)Online publication date: 10-Feb-2023
https://doi.org/10.1002/9781119825968.ch8
Alzahrani EBouabdallah FAlmisbahi H(2022)State of the Art in Quorum-Based Sleep/Wakeup Scheduling MAC Protocols for Ad Hoc and Wireless Sensor NetworksWireless Communications & Mobile Computing10.1155/2022/66253852022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/6625385
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Fair group mutual exclusion

Space-efficient FCFS group mutual exclusion

Group mutual exclusion in linear time and space

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations