The mutual exclusion problem: part II---Statement and solutions

DOI10.1145/3335772.3335938MaRDI QIDQ5133678zbMATH OpenOpenAlexFDO

Authors Leslie Lamport

Publication date 10 November 2020

Published in Concurrency: the Works of Leslie Lamport (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The mutual exclusion problem
• On the mutual-exclusion problem -- a quest for minimal solutions
• The mutual exclusion problem
• The mutual exclusion problem. I: A theory of interprocess communication
• A fine-grained solution to the mutual exclusion problem
• Adaptive solutions to the mutual exclusion problem
• Comments on Morris's starvation-free solution to the mutual exclusion problem
• A mutual exclusion algorithm with optimally bounded bypasses
• Peterson's mutual exclusion algorithm revisited

Cited in

(32)

• Distributed mutual exclusion on a ring of processes
• Comments on Morris's starvation-free solution to the mutual exclusion problem
• An optimal distributed solution to the dining philosphers problem
• Mutual exclusion versus coexistence for discrete competitive systems
• A note of Raymond's tree based algorithm for distributed mutual exclusion
• A fine-grained solution to the mutual exclusion problem
• On the mutual-exclusion problem -- a quest for minimal solutions
• On the correctness of Goscinski's algorithm
• A short technical paper: Determining whether a vote assignment is dominated
• Resilience of mutual exclusion algorithms to transient memory faults
• On optimal management of resources in distributed networks
• On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion
• scientific article; zbMATH DE number 4082934 (Why is no real title available?)
• Computing with infinitely many processes
• scientific article; zbMATH DE number 2049014 (Why is no real title available?)
• On the family of critical section problems
• The Driving Philosophers
• Starvation-free mutual exclusion with semaphores
• scientific article; zbMATH DE number 2086790 (Why is no real title available?)
• scientific article; zbMATH DE number 842887 (Why is no real title available?)
• scientific article; zbMATH DE number 1435948 (Why is no real title available?)
• A new solution of Dijkstra's concurrent programming problem
• The mutual exclusion problem. I: A theory of interprocess communication
• On the signaling problem
• Distributed mutual exclusion problem in cellular automata
• A new solution to the critical section problem
• Wait-Free Dining Under Eventual Weak Exclusion
• The mutual exclusion problem
• The mutual exclusion problem
• Mutual exclusion vs consensus: both sides of the same coin?
• A technique for decomposing algorithms which use a single shared variable
• Alternators in read/write atomicity

This page was built for publication: The mutual exclusion problem: part II---Statement and solutions

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