Anonymous user menu

Gate2005_71

Suppose n processes, P1, …. Pn share m identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process Pi is si, where si >0. Which one of the following is a sufficient condition for ensuring that deadlock does not occur?

(a) \(
\forall\)
i, si < m
(b) \(
\forall\)
i,  si < n
(C) \(\sum_{\substack{i=1 }}^n s_i < (m +n)\)
(D) \(\sum_{\substack{i=1 }}^n s_i < (m * n)\)

Answer

Discuss

0Comment