Example (contd.)
In other words, in the current state P2 can run with AVAIL, P1 can go after completion of P2 with the reclaimed resources from P2+AVAIL, next P3 can go with available resources from {P2,P1}+AVAIL, and finally P4 with resources from {P2,P1,P3}+AVAIL.
Next we will look at an example that illustrates complete allocation scheme “avoids” deadlock by making use of this safety algorithm discussed above.