|
28th Annual Conference on Current
Trends in
Theory and Practice of Informatics
|
|
November 24 - December 1, 2001
|
|
Bounding Lamport's Bakery Algorithm
by Prasad Jayanti, King Tan, Gregory Friedland and Amir Katz
Abstract:
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 between 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.