SOFSEM 2001: SOFSEM 2001: Theory and Practice of Informatics pp 261-270 | Cite as
Bounding Lamport’s Bakery Algorithm
Conference paper
First Online:
Abstract
Lamport’s Bakery algorithm is among the rest known mutual exclusion algorithms. A drawback of Lamport’s algorithm is that it requires unfounded registers for communication among processes. By making a small modification to Lamport’s algorithm, we remove the need for unfounded registers. The main appeal of our algorithm lies in the fact that it overcomes a drawback of a famous algorithm while preserving its elegance.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Attiya, H., and Welch, J.:Distributed Computing:Fundamentals, Simulations and Advanced Topics. McGraw-Hill Publishing Company, May 1998.Google Scholar
- 2.Lamport, L.:A new solution of Dijkstra’s concurrent programming problem.Communications of the ACM 17, 8 (August 1974)453–455.MATHCrossRefMathSciNetGoogle Scholar
- 3.Lycklama, E., and Hadzilacos, V.:A first-come-first-served mutual-exclusion algorithm with small communication variables.ACM Transactions on Programming Languages and Systems 13, 4 (October 1991)558–576.CrossRefGoogle Scholar
- 4.Lynch, N.:Distributed Algorithms. Morgan Kaufmann Publishers 1996.Google Scholar
- 5.Raynal, M.:Algorithms for Mutual Exclusion. The MIT Press 1986.Google Scholar
- 6.Silberschatz, A., Peterson, J., and Galvin, P.:Operating System Concepts. Addison-Wesley Publishing Company 1991.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2001