Deadlocks. The Banker’s algorithm is used for deadlock avoidance. Consider the state of resource availability and allocation defined by the following matrices.
Deadlocks. The Banker’s algorithm is used for deadlock avoidance. Consider the state of resource availability and allocation defined by the following matrices.
(1) Assuming that the total amounts for resources R1, R2, and R3 are 10, 2, and 10, should a new request to the Banker’s algorithm by process P3 to acquire one additional resource from R1 and one additional resource from R3 be approved or denied? Explain why or why not
(2) Assuming that the total amounts for resources R1, R2, and R3 are 10, 2, and 10, should a new request to the Banker’s algorithm by process P4 to acquire one additional resource from R3 be approved or denied? Explain why or why not.
(3) Assuming that the total amounts for resources R1 and R2 are 10 and 2, what is the minimum amount for resource R3 that would render the above state a safe state under the Banker’s algorithm? P3, and P4 to complete their execution subject to the Banker’s algorithm amount for resource R3 that would make it possible for the Banker’s algorithm to allow process
(4) Given your answer for part (3) what are all the possible orderings for the four processes P1, P2,
(5) Assuming that the total amounts for resources R1 and R2 are 10 and 2, what is the minimum P1 to complete its execution before all other three processes?
In: Other
