Resource Allocation Graph (cont.)

• A graph with a cycle but without a deadlock:

• If there are no cycles then there is no deadlock.

• If there is a cycle:

  • If there is only one instance per resource type then there is a deadlock.
  • If there is more than one instance for some resource type, there may or may not be a deadlock.

P1

P2

P3

R1

R2

Previous slide

Next slide

Back to first slide

View graphic version