A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables

DOI10.1145/357195.357199zbMath0498.68011OpenAlexW2023292202MaRDI QIDQ3964004

Gary L. Peterson

Publication date: 1983

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/357195.357199

zbMATH Keywords

synchronizationmutual exclusioncritical sectionmultiprocessingconcurrent programming control

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (7)

On the mutual-exclusion problem -- a quest for minimal solutions ⋮ Wait-free computing ⋮ Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms ⋮ Adaptive solutions to the mutual exclusion problem ⋮ Elucidating concurrent algorithms via layers of abstraction and reification ⋮ Nonatomic dual bakery algorithm with bounded tokens ⋮ A fine-grained solution to the mutual exclusion problem

This page was built for publication: A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables