Recommendations
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Queue based mutual exclusion with linearly bounded overtaking
- Mutual exclusion algorithms with constant RMR complexity and wait-free exit code
- Nonatomic dual bakery algorithm with bounded tokens
- scientific article; zbMATH DE number 2089981
Cites work
- scientific article; zbMATH DE number 3943003 (Why is no real title available?)
- scientific article; zbMATH DE number 4082934 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- A criterion for atomicity revisited
- A more efficient generalization of Peterson's mutual exclusion algorithm
- A mutual exclusion algorithm with optimally bounded bypasses
- A new solution of Dijkstra's concurrent programming problem
- An assertional proof for a construction of an atomic variable
- Myths about the mutual exclusion problem
- On interprocess communication. I: Basic formalism
Cited in
(11)- Queue based mutual exclusion with linearly bounded overtaking
- Simulation refinement for concurrency verification
- Analysing mutual exclusion using process algebra with signals
- scientific article; zbMATH DE number 1696665 (Why is no real title available?)
- Starvation-free mutual exclusion with semaphores
- On the correctness of Goscinski's algorithm
- Nonatomic dual bakery algorithm with bounded tokens
- Tournaments for mutual exclusion: verification and concurrent complexity
- Mutual exclusion scheduling
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Mutual exclusion as a matter of priority
This page was built for publication: A queue based mutual exclusion algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006897)
