The mutual exclusion problem

DOI10.1145/5383.5385zbMath0627.68018OpenAlexW2022907112WikidataQ56594044 ScholiaQ56594044MaRDI QIDQ5903450

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.5385

zbMATH Keywords

fairnesscommunicationcritical sectionshared variablesfailure-tolerance

Mathematics Subject Classification ID

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

Related Items

Bounded self-stabilizing Petri nets, The butterfly barrier, The entropy of a distributed computation random number generation from memory interleaving, Innovations in computational type theory using Nuprl, On optimal management of resources in distributed networks, A self-stabilizing algorithm for strong fairness, On the computational power of self-stabilizing systems, Group mutual exclusion in linear time and space, Space efficient processor identity protocol, Automated analysis of mutual exclusion algorithms using CCS, Nonatomic mutual exclusion with local spinning, The processor identity problem, On the power of shared object types to implement one-resilient Consensus, Shared-memory mutual exclusion: major research trends since 1986, Hundreds of impossibility results for distributed computing, Safety assurance via on-line monitoring, Tuning distributed control algorithms for optimal functioning, The computability of relaxed data structures: queues and stacks as examples, Optimality of wait-free atomic multiwriter variables, Tight space bounds for \(\ell\)-exclusion, Recoverable mutual exclusion, Self-stabilizing \(\ell\)-exclusion, Bounded time-stamps, Tight Space Bounds for ℓ-Exclusion, Space-efficient FCFS group mutual exclusion, Self-stabilizing extensions for message-passing systems, Self-stabilization over unreliable communication media, Stabilization and pseudo-stabilization, Efficiency of asynchronous systems, read arcs, and the MUTEX-problem, SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM, Self-stabilizing depth-first search, A fine-grained solution to the mutual exclusion problem