Banker’s Algorithm - Example (cont.)

• Suppose P1 now requests (1, 0, 2).

Available Allocation Max Need

A B C A B C A B C A B C

2 3 0 P0 0 1 0 7 5 3 7 4 3

P1 3 0 2 3 2 2 0 2 0

P2 3 0 2 9 0 2 6 0 0

P3 2 1 1 2 2 2 0 1 1

P4 0 0 2 4 3 3 4 3 1

<P1, P3, P0, P2, P4> is a safe sequence also in this case.

What if P4 then requests (3,3,0) ?

And if P0 requests (0,2,0) ?

Previous slide

Next slide

Back to first slide

View graphic version