Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority

DOI10.1007/978-3-319-25258-2_28zbMath1407.68067OpenAlexW2229892313MaRDI QIDQ3460731

Katia Patkin, Yoram Moses

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_28

zbMATH Keywords

mutual exclusionbakery algorithmsafe registersboulangerie algorithm

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Logical classification of distributed algorithms (Bakery algorithms as an example)
• On interprocess communication. I: Basic formalism
• Knowledge and common knowledge in a distributed environment
• A New Approach to Proving the Correctness of Multiprocess Programs
• A new solution of Dijkstra's concurrent programming problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority