Next: Deadlock Detection
Up: No Title
Previous: Bankers Algorithm
(aka Dining Philosophers - but I prefer trumpet players)
Designed by Dijkstra : used as a benchmark to test synchronisation primitives.
Figure 3: Dining Trumpet players)
Each needs two forks to eat - with alternate periods of eating and
- Aim : To pick up two forks (eat) and then put down the forks (talk) - and
do so without getting stuck.
- Acquire left fork, then right fork - if everyone wants to eat simultaneously -
we have deadlock!
- Some kind of time ordering - perhaps - is required
Omer F Rana
Sat Feb 15 21:34:55 GMT 1997