article

Free access

An optimal algorithm for mutual exclusion in computer networks

Authors:

Glenn Ricart,

Ashok K. AgrawalaAuthors Info & Claims

Communications of the ACM, Volume 24, Issue 1

Pages 9 - 17

https://doi.org/10.1145/358527.358537

Published: 01 January 1981 Publication History

PDF eReader

References

[1]

Courtois, P.J., Heymans, F., and Parnas, D.L. Concurrent control with "readers" and "writers." Comm. ACM 14, 10 (Oct. 1971), 667- 668.

Digital Library

Google Scholar

[2]

deBruijn, N.G. Additional comments on a problem in concurrent programming and control. Comm. ACM 10, 3 (March 1967), 137- 138.

Digital Library

Google Scholar

[3]

Dijkstra, E.W. Hierarchical ordering of sequential processes. Acta lnformatica 1, 2 (1971), 115-138.

Google Scholar

[4]

Dijkstra, E.W. Solution of a problem in concurrent programming control Comm. ACM 8, 9 (Sept. 1965), 569.

Digital Library

Google Scholar

[5]

Dijkstra, E.W. The structure of the THE multiprogramming system. Comm. ACM 11, 5 (May 1968), 341-346.

Digital Library

Google Scholar

[6]

Eisenberg, M.A., and McGuire, M.R. Further comments on Dijkstra's concurrent programming control problem. Comm. A CM 15, 11 (Nov. 1972), 999.

Digital Library

Google Scholar

[7]

Hill, J. Carver. Synchronizing processors with memory-contentsgenerated interrupts. Comm. ACM 16, 6 (June 1973), 350-351.

Digital Library

Google Scholar

[8]

Knuth, D.E. Additional comments on a problem in concurrent programming control. Comm. ACM 9, 5 (May 1966), 321-322.

Digital Library

Google Scholar

[9]

Lamport, U A new solution of Dijkstra's concurrent programming problem. Comm. ACM 17, 8 (Aug. 1974), 453-455.

Digital Library

Google Scholar

[10]

Lamport, U Time, clocks and the ordering of events in a distributed system. Comm. A CM 21, 7 (July 1978), 558-565.

Digital Library

Google Scholar

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

Google Scholar

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

Google Scholar

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

Google Scholar

Cited By

View all

Permiashkin DZyubin V(2024)Algorithmic Conflict Detection in Process-Oriented Programs2024 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM)10.1109/ICIEAM60818.2024.10553674(848-852)Online publication date: 20-May-2024
https://doi.org/10.1109/ICIEAM60818.2024.10553674
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
Bashari BJamadi AWoelfel POshman RNolin AHalldorsson MBalliu A(2023)Efficient Bounded Timestamping from Standard Synchronization PrimitivesProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594601(113-123)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594601
Show More Cited By

Index Terms

An optimal algorithm for mutual exclusion in computer networks
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Communications management
        Process management
        Mutual exclusion

Recommendations

A mutual exclusion algorithm with optimally bounded bypasses

Peterson's algorithm [G.L. Peterson, Myths about the mutual exclusion problem, Inform. Process. Lett. 12 (3) (1981) 115-116] for mutual exclusion has been widely studied for its elegance and simplicity. In Peterson's algorithm, each process has to cross ...
(h, k)-Arbiters for h-out-of-k mutual exclusion problem

h-Out-of-k mutual exclusion is a generalization of the 1-mutual exclusion problem, where there are k units of shared resources and each process requests h (1 ≤ h ≤ k) units at the same time. Though k-arbiter has been shown to be a quorum-based solution ...
On the family of critical section problems

A unified framework is proposed for mutual exclusion, mutual inclusion and such what we call critical section problem.Critical section problem is characterized by a pair of integers.The family of critical section problems is closed under complement ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 24, Issue 1

Jan. 1981

35 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/358527

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1981

Published in CACM Volume 24, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

538
Total Citations
View Citations
6,310
Total Downloads

Downloads (Last 12 months)1,024
Downloads (Last 6 weeks)50

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Permiashkin DZyubin V(2024)Algorithmic Conflict Detection in Process-Oriented Programs2024 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM)10.1109/ICIEAM60818.2024.10553674(848-852)Online publication date: 20-May-2024
https://doi.org/10.1109/ICIEAM60818.2024.10553674
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
Bashari BJamadi AWoelfel POshman RNolin AHalldorsson MBalliu A(2023)Efficient Bounded Timestamping from Standard Synchronization PrimitivesProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594601(113-123)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594601
Santos A(2023)Cooperative hypermedia editing with CoMEdiAJournal of Computer Science and Technology10.1007/BF029395338:3(257-269)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF02939533
Mattern F(2023)Asynchronous distributed termination—parallel and symmetric solutions with echo algorithmsAlgorithmica10.1007/BF018403925:1-4(325-340)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01840392
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
Полухин П(2022)Application of queueing theory methods for estimating synchronization parameters of distributed computing systemsМОДЕЛИРОВАНИЕ, ОПТИМИЗАЦИЯ И ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ10.26102/2310-6018/2022.37.2.02810:2(37)(28-29)Online publication date: 4-Apr-2022
https://doi.org/10.26102/2310-6018/2022.37.2.028
Lamport L(2022)Deconstructing the bakery to build a distributed state machineCommunications of the ACM10.1145/351325965:9(58-66)Online publication date: 19-Aug-2022
https://dl.acm.org/doi/10.1145/3513259
Mery D(2021)Refinement-based Construction of Correct Distributed Algorithms2021 Second International Conference on Information Systems and Software Technologies (ICI2ST)10.1109/ICI2ST51859.2021.00015(46-53)Online publication date: Mar-2021
https://doi.org/10.1109/ICI2ST51859.2021.00015
Richard AFrancis JKawash J(2021)Basic Distributed Algorithms Visual Simulations for Distributed Systems Students2021 IEEE Global Engineering Education Conference (EDUCON)10.1109/EDUCON46332.2021.9453906(199-205)Online publication date: 21-Apr-2021
https://doi.org/10.1109/EDUCON46332.2021.9453906
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.

Cited By

Index Terms

Recommendations

A mutual exclusion algorithm with optimally bounded bypasses

(h, k)-Arbiters for h-out-of-k mutual exclusion problem

On the family of critical section problems

Comments

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

A mutual exclusion algorithm with optimally bounded bypasses

(h, k)-Arbiters for h-out-of-k mutual exclusion problem

On the family of critical section problems

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

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