The mutual exclusion problem

DOI10.1145/5383.5384MaRDI QIDQ5903449zbMATH OpenOpenAlexFDO

Authors 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 programconcurrent systemsinterprocess communicationnonatomic operationsreaders/writersshared variables

Mathematics Subject Classification ID

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

Recommendations

• The mutual exclusion problem. I: A theory of interprocess communication
• The mutual exclusion problem: part II---Statement and solutions
• The mutual exclusion problem
• A new solution of Dijkstra's concurrent programming problem
• On the family of critical section problems

Cited in

(79)

• Distributed mutual exclusion on a ring of processes
• On interprocess communication. I: Basic formalism
• On interprocess communication. II: Algorithms
• An implementation of mutual inclusion
• Comments on Morris's starvation-free solution to the mutual exclusion problem
• Distributed match-making
• The equational theory of pomsets
• Functional specification and proof of correctness for time dependent behaviour of reactive systems
• Bounded time-stamps
• Some impossibility results in interprocess synchronization
• A fine-grained solution to the mutual exclusion problem
• On the mutual-exclusion problem -- a quest for minimal solutions
• Two implementation relations and the correctness of communicating replicated processes
• Peterson's mutual exclusion algorithm revisited
• The entropy of a distributed computation random number generation from memory interleaving
• Tournaments for mutual exclusion: verification and concurrent complexity
• Exposing latent mutual exclusion by work automata
• Interval semantics for Petri nets with inhibitor arcs
• On the correctness of Goscinski's algorithm
• Bounded delay for a free address
• Lattice structure of temporal interval relations
• Relational structures for concurrent behaviours
• Recoverable mutual exclusion
• A visit to mutual exclusion in seven dates
• Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
• Classifying invariant structures of step traces
• scientific article; zbMATH DE number 1696673 (Why is no real title available?)
• A concurrent implementation of skip graphs
• On interval process semantics of Petri nets with inhibitor arcs
• Non-atomic transition firing in contextual nets
• scientific article; zbMATH DE number 3848597 (Why is no real title available?)
• The Arthur Prior memorial conference, Christchurch, 1989
• Automatic Mutual Exclusion and Atomicity Checks
• The Mailbox Problem
• Communicating parallel processes
• Symmetric intertask communication
• A modula-2 kernel for supporting monitors
• Une approche quantitative de l'exclusion mutuelle
• On Maintaining Dynamic Information in a Concurrent Environment
• scientific article; zbMATH DE number 4035113 (Why is no real title available?)
• scientific article; zbMATH DE number 4043219 (Why is no real title available?)
• scientific article; zbMATH DE number 4082934 (Why is no real title available?)
• ON PV_chunk OPERATIONS AND MATROGENIC GRAPHS
• scientific article; zbMATH DE number 2049014 (Why is no real title available?)
• On the family of critical section problems
• scientific article; zbMATH DE number 3997155 (Why is no real title available?)
• Analysing mutual exclusion using process algebra with signals
• Languages of higher-dimensional automata
• Generating Posets Beyond N
• A new solution of Dijkstra's concurrent programming problem
• How to make a microprocessor computer that correctly executes multiprocess programs
• The mutual exclusion problem. I: A theory of interprocess communication
• The mutual exclusion problem: part II---Statement and solutions
• Linearizable counting networks
• Shared-memory mutual exclusion: major research trends since 1986
• Modeling concurrency with interval traces
• The computability of relaxed data structures: queues and stacks as examples
• Distributed mutual exclusion problem in cellular automata
• Elucidating concurrent algorithms via layers of abstraction and reification
• A new solution to the critical section problem
• The mutual exclusion problem
• Step traces
• Solving infinite-domain CSPs using the patchwork property
• Mutual exclusion vs consensus: both sides of the same coin?
• The mailbox problem
• Complexity classification transfer for CSPs via algebraic products
• Structure of concurrency
• Process-algebraic models of multi-writer multi-reader non-atomic registers
• Just verification of mutual exclusion algorithms
• Correctness and concurrent complexity of the black-white bakery algorithm
• Nivat's processing systems: decision problems related to protection and synchronization
• Nonatomic dual bakery algorithm with bounded tokens
• A technique for decomposing algorithms which use a single shared variable
• Point algebras for temporal reasoning: Algorithms and complexity
• Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
• Automated analysis of mutual exclusion algorithms using CCS
• The processor identity problem
• Blocking versus nonblocking interprocess communication: A note on the effect on concurrency
• Relational structures model of concurrency

This page was built for publication: The mutual exclusion problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5903449)