PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 1, 1971Communications of the ACM529 citationsOpen Access

Concurrent control with “readers” and “writers”

PCPierre CourtoisUniversitat Autònoma de BarcelonaFHF. HeymansNational Library of SwedenDPDavid Lorge ParnasUniversity of Limerick

Key Points

  • This work investigates how to prevent simultaneous access to critical sections by independent processes labeled as 'readers' and 'writers'.
  • Proposes two solutions addressing distinct needs: minimizing delay for readers and facilitating early writing.
  • Analyzes the behavior of reader and writer processes in a concurrent system.
  • The first solution significantly reduces readers' wait time, enhancing performance when multiple readers access the section.
  • The second solution guarantees that writers can gain immediate entry to the critical section, improving writing efficiency.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Courtois et al. (1971) studied this question.

synapsesocial.com/papers/6a08f75e73218fa1919d0922https://doi.org/10.1145/362759.362813
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Development of lock-free approach for shared memory organisation in real-time multi-threading applications2024 · 1 citations
  2. 2Age-Memory Trade-off in Read-Copy-Update2024
  3. 3A Constructive Method for Resolving Multiple Access Conflicts in Process-Oriented Programs2025
  4. 4Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model2024
  5. 5History-Independent Concurrent Objects2024