Multiple choice

Consider the following snapshot of a system running n processes. Process i is holding xi instances of a resource R, 1$\le$ i$\le$ n. currently, all instances of R are occupied. Further, for all i, process i has placed a request for an additional yi instances while holding the xi instances it already has. There are exactly two processes p and q such that 0. yp = yq = 0. Which one of the following can serve as a necessary condition to guarantee that the system is not approaching a deadlock?

  1. min (xp, xq) < $max_{k \neq p, q}$yk
  2. xp + xq $\ge$$max_{k \neq p, q}$. yk
  3. max (xp, xq) > 1

  4. min(xp, xq) > 1

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation