Deadlock Example

• For N=2, call philosophers P1 and P2, and chopsticks C1 and C2

• Deadlocking sequence:

  P1 requests; gets C1
  
  P2 requests; gets C2
  P1 requests; WAITS for C2
  P2 requests; WAITS for C1
  
  ** DEADLOCK **

• Can avoid deadlock if the philosopher processes request both chopsticks at once, and then the get both or wait until both are available

Previous slide

Next slide

Back to first slide

View graphic version