The mutual exclusion problem

DOI10.1145/5383.5384zbMath0627.68017OpenAlexW2056740525MaRDI QIDQ5903449

Leslie Lamport

Publication date: 1986

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

concurrent systemsconcurrent programinterprocess communicationnonatomic operationsshared variablesreaders/writers

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of operating systems (68N25)

Related Items (35)

On the mutual-exclusion problem -- a quest for minimal solutions ⋮ A visit to mutual exclusion in seven dates ⋮ Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Distributed match-making ⋮ Two implementation relations and the correctness of communicating replicated processes ⋮ The entropy of a distributed computation random number generation from memory interleaving ⋮ Lattice structure of temporal interval relations ⋮ Languages of higher-dimensional automata ⋮ The equational theory of pomsets ⋮ On Interval Process Semantics of Petri Nets with Inhibitor Arcs ⋮ Non-atomic Transition Firing in Contextual Nets ⋮ Tournaments for mutual exclusion: verification and concurrent complexity ⋮ Generating Posets Beyond N ⋮ Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms ⋮ Classifying invariant structures of step traces ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ The processor identity problem ⋮ Linearizable counting networks ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Functional specification and proof of correctness for time dependent behaviour of reactive systems ⋮ Relational structures model of concurrency ⋮ Interval semantics for Petri nets with inhibitor arcs ⋮ Modeling concurrency with interval traces ⋮ The computability of relaxed data structures: queues and stacks as examples ⋮ Structure of concurrency ⋮ Relational structures for concurrent behaviours ⋮ Elucidating concurrent algorithms via layers of abstraction and reification ⋮ Recoverable mutual exclusion ⋮ The Arthur Prior memorial conference, Christchurch, 1989 ⋮ Step traces ⋮ Correctness and concurrent complexity of the black-white bakery algorithm ⋮ Bounded time-stamps ⋮ Nonatomic dual bakery algorithm with bounded tokens ⋮ A Concurrent Implementation of Skip Graphs ⋮ Point algebras for temporal reasoning: Algorithms and complexity

This page was built for publication: The mutual exclusion problem