Consider the Deadlock Avoidance problem. Suppose we have four types of resources: 9 of type-A, 3 of
Fantastic news! We've Found the answer you've been seeking!
Question:
Consider the Deadlock Avoidance problem. Suppose we have four types of resources: 9 of type-A, 3 of type-B and 6 of type-C. In the current state, maximum resources are needed, and the resources allocated to each of the processes are given as the following:
(a) Calculate the need matrix and the available array.
(b) Show that the current state is safe, that is, show a safe sequence of processes.
(c) Consider that two requests are presented separately:
Req (P 2 , [0, 0, 1]) and Req (P 4 , [0, 1, 0]).
Can these two requests be granted?
Related Book For
Posted Date: