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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Gutknecht, J. (2006). The dining philosophers problem revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4228 LNCS, pp. 377–382). Springer Verlag. https://doi.org/10.1007/11860990_23
Mendeley helps you to discover research relevant for your work.