Consider the following 4 processes in the system Shown below

Consider the following 4 processes in the system. Shown below are the resources allocated and requested by the processes at time t, as well. as the available resource vector. Is there a deadlock at time t? Suppose the cost of aborting P1 is 6, P2 is 12, P3 is 7 and P4 is 8. Find the minimum cost deadlock breaking set.

Solution

Sure, there is a deadlock at time t. because the available resource is ( 0,0,1,0 ). using this resource no process can complete their execution. because every process requested for more number of resources than the available resource. therefore there will be a deadlock at time t.

p1 requested for 2 1 2 0

p2 requested for 1 2 2 3

p3 requested for 2 1 3 3

p4 requested for 3 0 1 2

Available resource is ( 0,0,1,0 ).

it is not possible to satisfy any of the process with available resources.