Dining Computer Scientists
Computer Scientists’
Algorithm
Take lower-numbered
adjacent fork
Take higher-numbered
adjacent fork
EAT
Replace both forks
CLAIM: Deadlock is impossible!
Pi holding fork i deadlock will never occur because
P2 will never hold fork 2 without holding fork 1 also.
Previous slide
Next slide
Back to first slide
View graphic version