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
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
64.3k questions
77.9k answers
244k comments
80.0k users