Algorithms for mutual exclusion
Algorithms for mutual exclusion
Operating system concepts (3rd ed.)
Operating system concepts (3rd ed.)
A first-come-first-served mutual-exclusion algorithm with small communication variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Distributed Algorithms
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Theoretical Computer Science
Group mutual exclusion algorithms based on ticket orders
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Highly-fair bakery algorithm using symmetric tokens
Information Processing Letters
Logical classification of distributed algorithms (Bakery algorithms as an example)
Theoretical Computer Science
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Lamport's Bakery algorithm is among the best known mutual exclusion algorithms. A drawback of Lamport's algorithm is that it requires unbounded registers for communication among processes. By making a small modification to Lamport's algorithm, we remove the need for unbounded registers. The main appeal of our algorithm lies in the fact that it overcomes a drawback of a famous algorithm while preserving its elegance.