The Dining Philosophers Problem Revisited
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.
KeywordsCritical Section Mutual Exclusion Filter Algorithm Mutual Exclusion Algorithm Dine Philosopher
Unable to display preview. Download preview PDF.
- 1.Dijkstra, E.W.: Hierarchical Ordering of Sequential Processes, Acts Informatica I, pp. 115–138 (1971)Google Scholar
- 4.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/