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.
CITATION STYLE
Jayanti, P., Tan, K., Friedland, G., & Katz, A. (2001). Bounding Lamport’s bakery algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2234, pp. 261–270). Springer Verlag. https://doi.org/10.1007/3-540-45627-9_23
Mendeley helps you to discover research relevant for your work.