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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Attiya, H., and Welch, J.:Distributed Computing:Fundamentals, Simulations and Advanced Topics. McGraw-Hill Publishing Company, May 1998.
Lamport, L.:A new solution of Dijkstra’s concurrent programming problem.Communications of the ACM 17, 8 (August 1974)453–455.
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.
Lynch, N.:Distributed Algorithms. Morgan Kaufmann Publishers 1996.
Raynal, M.:Algorithms for Mutual Exclusion. The MIT Press 1986.
Silberschatz, A., Peterson, J., and Galvin, P.:Operating System Concepts. Addison-Wesley Publishing Company 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jayanti, P., Tan, K., Friedland, G., Katz, A. (2001). Bounding Lamport’s Bakery Algorithm. In: Pacholski, L., Ružička, P. (eds) SOFSEM 2001: Theory and Practice of Informatics. SOFSEM 2001. Lecture Notes in Computer Science, vol 2234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45627-9_23
Download citation
DOI: https://doi.org/10.1007/3-540-45627-9_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42912-8
Online ISBN: 978-3-540-45627-8
eBook Packages: Springer Book Archive