article

Free access

A fast mutual exclusion algorithm

Author: Leslie LamportAuthors Info & Claims

ACM Transactions on Computer Systems (TOCS), Volume 5, Issue 1

Pages 1 - 11

https://doi.org/10.1145/7351.7352

Published: 05 January 1987 Publication History

PDF eReader

Abstract

A new solution to the mutual exclusion problem is presented that, in the absence of contention, requires only seven memory accesses. It assumes atomic reads and atomic writes to shared registers.

References

[1]

DEBRUIJN, N. G. Additional comments on a problem in concurrent programming control. Commun. ACM 8, 9 (Max. 1967), 137-138.

Crossref

Google Scholar

[2]

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

Crossref

Google Scholar

[3]

EISENBERG, M. A., AND MCGUIRE, M. R. Further comments on Dijkstra's concurrent programming control problem. Commun. ACM 15, 11 (Nov. 1972), 999.

Crossref

Google Scholar

[4]

FLOYD, R. W. Assigning meanings to programs. In Procevd/n~ of the Sympa~um on Applied Mat/~, vol. 19 (1967), American Mathematical Society, Providence, R.I., pp. 19-32.

Google Scholar

[5]

JONES, A. K., AND SCHWARZ, P. Experience using multiprocessor systems--A status report. ACM Comput. Surv. 12, 2 (June 1980), 121-165.

Crossref

Google Scholar

[6]

KNUTli, D. E. Additional commments on a problem in concurrent program control. Commun. ACM 9, 5 (May 1966), 321.

Crossref

Google Scholar

[7]

LAMPORT, L. Proving the correctness of multiprocess programs. IEEE ~Tans. Soflw. Eng. SE-3, 2 (Mar. 1977), 125-143.

Google Scholar

[8]

OWICKI, S., AND GRIES, D. An axiomatic proof technique for parallel programs. Acta Inf. 6, 4 (1976), 319-340.

Google Scholar

[9]

OWICKI, S., AND LAMPORT, L. Proving liveness properties of concurrent programs. ACM Trans. Program. Lang. Sy~ 4, 3 (July 1982), 455-495.

Crossref

Google Scholar

Cited By

View all

Liu HLi G(2024)Empirically Scalable Invariant Generation Leveraging Divide-and-Conquer with PruningTheoretical Aspects of Software Engineering10.1007/978-3-031-64626-3_19(324-342)Online publication date: 14-Jul-2024
https://doi.org/10.1007/978-3-031-64626-3_19
Permiashkin D(2023)On Solving Concurrent Process Problem in Process-Oriented ProgramsVestnik NSU. Series: Information Technologies10.25205/1818-7900-2023-21-2-5-1721:2(5-17)Online publication date: 5-Oct-2023
https://doi.org/10.25205/1818-7900-2023-21-2-5-17
Pedersen JChalmers K(2023)Toward Verifying Cooperatively Scheduled Runtimes Using CSPFormal Aspects of Computing10.1145/360594235:4(1-45)Online publication date: 21-Nov-2023
https://dl.acm.org/doi/10.1145/3605942
Show More Cited By

Index Terms

A fast mutual exclusion algorithm

Recommendations

Fast mutual exclusion for uniprocessors

In this paper we describe restartable atomic sequences, an optimistic mechanism for implementing simple atomic operations (such as Test-And-Set) on a uniprocessor. A thread that is suspended within a restartable atomic sequence is resumed by the ...
Read More
Fast mutual exclusion for uniprocessors
ASPLOS V: Proceedings of the fifth international conference on Architectural support for programming languages and operating systems

In this paper we describe restartable atomic sequences, an optimistic mechanism for implementing simple atomic operations (such as Test-And-Set) on a uniprocessor. A thread that is suspended within a restartable atomic sequence is resumed by the ...
Read More
A fast, scalable mutual exclusion algorithm

This paper is concerned with synchornization under read/write atomicity in shared memory multi-processors. We present a new algorithm forN-process mutual exclusion that requires only read and write operations and that hasO(logN) time complexity, where "...
Read More

Reviews

Reviewer: Charles N. Schroeder

This paper reexamines the traditional mutual exclusion problem, approaching it with the perspective that some recent shared-memory multiprocessor systems consist of off-the-shelf processor and memory systems with little or no modification. Fast shared-memory mutual exclusion algorithms need to be further examined. Algorithms are presented that are improvements to previous mutual exclusion algorithms; deadlock freedom is appropriately addressed. The paper and the informal proofs are well written. This paper should be of interest to those working in the process management and mutual exclusion areas.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computer Systems

ACM Transactions on Computer Systems Volume 5, Issue 1

Feb. 1987

93 pages

ISSN:0734-2071

EISSN:1557-7333

DOI:10.1145/7351

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 January 1987

Published in TOCS Volume 5, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

406
Total Citations
View Citations
2,639
Total Downloads

Downloads (Last 12 months)137
Downloads (Last 6 weeks)18

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu HLi G(2024)Empirically Scalable Invariant Generation Leveraging Divide-and-Conquer with PruningTheoretical Aspects of Software Engineering10.1007/978-3-031-64626-3_19(324-342)Online publication date: 14-Jul-2024
https://doi.org/10.1007/978-3-031-64626-3_19
Permiashkin D(2023)On Solving Concurrent Process Problem in Process-Oriented ProgramsVestnik NSU. Series: Information Technologies10.25205/1818-7900-2023-21-2-5-1721:2(5-17)Online publication date: 5-Oct-2023
https://doi.org/10.25205/1818-7900-2023-21-2-5-17
Pedersen JChalmers K(2023)Toward Verifying Cooperatively Scheduled Runtimes Using CSPFormal Aspects of Computing10.1145/360594235:4(1-45)Online publication date: 21-Nov-2023
https://dl.acm.org/doi/10.1145/3605942
Zheng WWang DSong F(2023)A Distributed-GPU Deep Reinforcement Learning System for Solving Large Graph Optimization ProblemsACM Transactions on Parallel Computing10.1145/358918810:2(1-23)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3589188
Hesselink WBuhr P(2023)MCSH, a Lock with the Standard InterfaceACM Transactions on Parallel Computing10.1145/358469610:2(1-23)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3584696
Aleeva VAleev R(2023)Investigation and Implementation of Parallelism Resources of Numerical AlgorithmsACM Transactions on Parallel Computing10.1145/358375510:2(1-64)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3583755
Zhang ZGlova ASherwood TBalkind JAamodt TJerger NSwift M(2023)A Prediction System ServiceProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3575693.3575714(48-60)Online publication date: 27-Jan-2023
https://dl.acm.org/doi/10.1145/3575693.3575714
Aksenov VBrown TFedorov AKokorin IDehnavi MKulkarni MKrishnamoorthy S(2023)Unexpected Scaling in Path Copying TreesProceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3572848.3577512(438-440)Online publication date: 25-Feb-2023
https://dl.acm.org/doi/10.1145/3572848.3577512
Shahare VChabbi MHegde NAgrawal KShun J(2023)Protecting Locks Against Unbalanced Unlock()Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591091(199-211)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3558481.3591091
Srinivasan KMoses YManohar R(2023)Opportunistic Mutual Exclusion2023 28th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)10.1109/ASYNC58294.2023.10239610(1-9)Online publication date: 16-Jul-2023
https://doi.org/10.1109/ASYNC58294.2023.10239610
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

Fast mutual exclusion for uniprocessors

Fast mutual exclusion for uniprocessors

A fast, scalable mutual exclusion algorithm

Reviews

Access critical reviews of Computing literature here

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