The Deadlock Problem

• Permanent blocking of a set of processes that either compete for system resources or communicate with each other.

• Example: Semaphores A and B, initialized to 1.

  
  
  P0 P1
  wait(A); wait(B);
  wait(B); wait(A);

Previous slide

Next slide

Back to first slide

View graphic version