Resource Allocation Graph Example
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
R1
R3
R3
R4
R2
P3
P2
P1
R1
P1
P2
P3
P4
R2
R4
There are two cycles here: P1-R1-P2-R3-P3-R2-P1
and P2-R3-P3-R2-P2, and there is deadlock.
Same cycles, but no deadlock.
Previous slide
Next slide
Back to first slide
View graphic version