in Operating System retagged by
1,897 views
5 votes
5 votes

Consider a system with $m$ resources of same type being shared by $n$ processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only if

  1. The sum of all max needs is $< m+n$
  2. The sum of all max needs is $>m+n$
  3. Both of above
  4. None
in Operating System retagged by
1.9k views

1 comment

Correct answer is a
1
1

1 Answer

2 votes
2 votes

for deadlock free condition 

R ≥ P(N − 1) + 1   =m >=n(N-1)+1 = m>=nN-n+1 =m+n>=nN+1    here N=1 max need so m+n>=n+1
Answer:

Related questions