Q. Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of πΎ instances. Resource instances can be requested and released only one at a time. The largest value of πΎ that will always avoid deadlock is .
Ans: 2
Sol:
Given,
Number of processes (P) = 3
Number of resources (R) = 4
Since deadlock-free condition is:R β₯ P(N β 1) + 1
Where R is total number of resources,
P is the number of processes, and
N is the max need for each resource.4 β₯ 3(N β 1) + 1 3 β₯ 3(N β 1) 1 β₯ (N β 1) N β€ 2
Therefore, the largest value of K that will always avoid deadlock isΒ 2.