In: Other
Given the following state for the Banker's Algorithm
5 processes PO through P4
3 resource types before assigning to any process. A has 5 instances: B has 6 Instances. C has 8 instances and D has 4.
Allocation: the resources currently assigned to each process
Max Claim: The maximum number of resource instances a process will need in order to complete.
Determine the available vector
Allocated matrix = (5, 6, 6, 2)
A has 5 instances, B has 6 instances, C has 8 instances, D has 4 instances which is (A, B, C, D) = (5, 6, 8, 4)
Available vector = (5, 6, 8, 4) - (5, 6, 6, 2)
Available vector = (0, 0, 2, 2)
Now calculate need
Need = Max - Allocation
Answer : "yes, p2, p0, p1, p3, p4"