Multiple choice

Suppose $n$ processes, $P_1, \dots P_n$ share $m$ identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process $P_i$ is $s_i$, where $s_i > 0$. Which one of the following is a sufficient condition for ensuring that deadlock does not occur?

  1. $\forall i,\: s_i, < m$
  2. $\forall i, \:s_i < n $
  3. $\Sigma_{i=1}^n \: s_i < (m+n)$
  4. $\Sigma_{i=1}^n \: s_i < (m \times n)$
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation