The mutual exclusion problem

DOI10.1145/5383.5385zbMath0627.68018WikidataQ56594044 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

fairness; communication; critical section; shared variables; failure-tolerance

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68N25: Theory of operating systems

Related Items

Self-stabilizing \(\ell\)-exclusion, Innovations in computational type theory using Nuprl, Space efficient processor identity protocol, Automated analysis of mutual exclusion algorithms using CCS, The processor identity problem, The butterfly barrier, Tuning distributed control algorithms for optimal functioning, Optimality of wait-free atomic multiwriter variables, Bounded time-stamps, Self-stabilizing extensions for message-passing systems, Self-stabilization over unreliable communication media, Stabilization and pseudo-stabilization, Self-stabilizing depth-first search, A fine-grained solution to the mutual exclusion problem, A self-stabilizing algorithm for strong fairness, On the computational power of self-stabilizing systems, Efficiency of asynchronous systems, read arcs, and the MUTEX-problem, Bounded self-stabilizing Petri nets, SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM, On optimal management of resources in distributed networks