Abstract
We present an alternative solution to the Dining Philosophers problem that is based on Peterson’s mutual exclusion algorithm for N processes, with the benefit of not using any ingredients beyond atomic read and write operations. We proceed in two steps towards a comprehensible, symmetric, and starvation-free algorithm that does neither rely on atomic test-and-set instructions nor on synchronization constructs such as monitors, signals, semaphores, locks, etc.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W.: Hierarchical Ordering of Sequential Processes, Acts Informatica I, pp. 115–138 (1971)
Silberschatz, A., Peterson, J.L.: Operating Systems Concepts. Addison-Wesley, Reading (1988)
Peterson, G.L.: Myths About the Mutual Exclusion Problem. IPL 12(3), 115–116 (1981)
Shavit, N.: Lecture Notes for Lecture 2, Chapter 2.4.1. Tel-Aviv University (2003), http://www.cs.tau.ac.il/~shanir/multiprocessor-synch-2003/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gutknecht, J. (2006). The Dining Philosophers Problem Revisited. In: Lightfoot, D.E., Szyperski, C. (eds) Modular Programming Languages. JMLC 2006. Lecture Notes in Computer Science, vol 4228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11860990_23
Download citation
DOI: https://doi.org/10.1007/11860990_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40927-4
Online ISBN: 978-3-540-40928-1
eBook Packages: Computer ScienceComputer Science (R0)