Banker's algorithm is one of the most representative deadlock avoidance algorithms. In the deadlock avoidance method, processes are allowed to apply for resources dynamically. However, before allocating resources, the system should first calculate the security of the allocated resources. If allocation does not lead to insecurity of the system, then allocation, otherwise waiting.

 

Process        Allocation        Need        Available

P0                   0 0 3 2           0 0 1 2         1 6 2 2

P1                    1 0 0 0           1 7 5 0

P2                    1 3 5 4            2 3 5 6

P3                    0 3 3 2           0 6 5 2

P4                    0 0 1 4           0 6 5 6

 

Find a security sequence (PO,P3,P4,P1,P2), so the system is safe.