article

Free access

Concurrent control with “readers” and “writers”

Authors:

P. J. Courtois,

F. Heymans,

D. L. ParnasAuthors Info & Claims

Communications of the ACM, Volume 14, Issue 10

Pages 667 - 668

https://doi.org/10.1145/362759.362813

Published: 01 October 1971 Publication History

PDF eReader

Abstract

The problem of the mutual exclusion of several independent processes from simultaneous access to a “critical section” is discussed for the case where there are two distinct classes of processes known as “readers” and “writers.” The “readers” may share the section with each other, but the “writers” must have exclusive access. Two solutions are presented: one for the case where we wish minimum delay for the readers; the other for the case where we wish writing to take place as early as possible.

References

[1]

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

Digital Library

Google Scholar

[2]

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

Digital Library

Google Scholar

[3]

de Bruijn, N.G. Additional comments on a problem in concurrent programming control. Comm. ACM 10, 3 (Mar. 1967), 137-138.

Digital Library

Google Scholar

[4]

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

Digital Library

Google Scholar

Cited By

View all

Zhang HCheng KChen RChen HGavrilovska ATerry D(2024)Fast and scalable in-network lock management using lock fissionProceedings of the 18th USENIX Conference on Operating Systems Design and Implementation10.5555/3691938.3691952(251-268)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.5555/3691938.3691952
Li TSong TYang YVanbever LZhang I(2024)iStackProceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation10.5555/3691825.3691841(267-280)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.5555/3691825.3691841
Tanygin MChesnokova A(2024)Segmentation of Tree-Like Data Structures and Their Parallel Processing in Authentication Methods Based on Block Coupling EncodingProceedings of the Southwest State University10.21869/2223-1560-2023-27-4-62-7827:4(62-78)Online publication date: 1-Mar-2024
https://doi.org/10.21869/2223-1560-2023-27-4-62-78
Show More Cited By

Recommendations

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 ...
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing

We present tradeoffs between RMR complexity and memory word size for recoverable mutual exclusion (RME) algorithms using arbitrary synchronization primitives. Assuming that each memory location stores w bits, we show that n-process mutual exclusion ...
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 ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 14, Issue 10

Oct. 1971

60 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/362759

Editor:
M. Stuart Lynn
IBM Scientific Center, Houston, TX

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 October 1971

Published in CACM Volume 14, Issue 10

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

430
Total Citations
View Citations
4,297
Total Downloads

Downloads (Last 12 months)434
Downloads (Last 6 weeks)63

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang HCheng KChen RChen HGavrilovska ATerry D(2024)Fast and scalable in-network lock management using lock fissionProceedings of the 18th USENIX Conference on Operating Systems Design and Implementation10.5555/3691938.3691952(251-268)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.5555/3691938.3691952
Li TSong TYang YVanbever LZhang I(2024)iStackProceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation10.5555/3691825.3691841(267-280)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.5555/3691825.3691841
Tanygin MChesnokova A(2024)Segmentation of Tree-Like Data Structures and Their Parallel Processing in Authentication Methods Based on Block Coupling EncodingProceedings of the Southwest State University10.21869/2223-1560-2023-27-4-62-7827:4(62-78)Online publication date: 1-Mar-2024
https://doi.org/10.21869/2223-1560-2023-27-4-62-78
Jevitha KJayaraman BSethumadhavan M(2024)Runtime verification on abstract finite state modelsJournal of Systems and Software10.1016/j.jss.2024.112138216(112138)Online publication date: Oct-2024
https://doi.org/10.1016/j.jss.2024.112138
Arslan RAkşit M(2024)Event-based digital-twin model for emergency managementManagement and Engineering of Critical Infrastructures10.1016/B978-0-323-99330-2.00008-8(155-176)Online publication date: 2024
https://doi.org/10.1016/B978-0-323-99330-2.00008-8
Raynal M(2024)On Distributed Computing: A View, Physical Versus Logical Objects, and a Look at Fully Anonymous SystemsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-74498-3_1(3-19)Online publication date: 20-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-74498-3_1
Mulder ICzajka ŁKrebbers R(2023)Beyond Backtracking: Connections in Fine-Grained Concurrent Separation LogicProceedings of the ACM on Programming Languages10.1145/35912757:PLDI(1340-1364)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591275
Lee DCho MKim JMoon SSong YHur C(2023)Fair Operational SemanticsProceedings of the ACM on Programming Languages10.1145/35912537:PLDI(811-834)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591253
Ramani VChen JYates R(2023)Timely Mobile Routing: An Experimental StudyIEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)10.1109/INFOCOMWKSHPS57453.2023.10226174(1-6)Online publication date: 20-May-2023
https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226174
Ramani VChen JYates R(2023)Lock-based or Lock-less: Which Is Fresh?IEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10229077(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10229077
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Recommendations

On the family of critical section problems

Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion

A mutual exclusion algorithm with optimally bounded bypasses

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

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations