A system that uses the Banker's Algorithm has six processes and four types of reusable resources...

   

Transcribed Image Text:

A system that uses the Banker's Algorithm has six processes and four types of reusable resources (R1, R2, R3 and R4). The current allocation, maximum needs (claims) and available resources are as shown below (Table 1). Table 1: Current allocation, maximum needs and available resources. Allocation Matrix (A) Claim Matrix (C) Available Vector (V) Process R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4 P1 1 0 0 0 3 2 1 4 0 2 3 3 222 P2 1 2 2 0 1 4 5 2 P3 2 1 3 0 4 2 4 5 P4 1 4 1 0 6 6 1 0 P5 1 2 0 1 2 3 1 3 P6 1 4 3 1 2 4 4 1 Calculate the Needs matrix (Q) and then determine if this is a safe state? If so, give a sequence in which the processes can be serviced. If it is not a safe state then list the processes which are deadlocked. Show all your work and the content of available vector in each step clearly! A system that uses the Banker's Algorithm has six processes and four types of reusable resources (R1, R2, R3 and R4). The current allocation, maximum needs (claims) and available resources are as shown below (Table 1). Table 1: Current allocation, maximum needs and available resources. Allocation Matrix (A) Claim Matrix (C) Available Vector (V) Process R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4 P1 1 0 0 0 3 2 1 4 0 2 3 3 222 P2 1 2 2 0 1 4 5 2 P3 2 1 3 0 4 2 4 5 P4 1 4 1 0 6 6 1 0 P5 1 2 0 1 2 3 1 3 P6 1 4 3 1 2 4 4 1 Calculate the Needs matrix (Q) and then determine if this is a safe state? If so, give a sequence in which the processes can be serviced. If it is not a safe state then list the processes which are deadlocked. Show all your work and the content of available vector in each step clearly!