search
Log In
0 votes
67 views
Consider the previous problem again, but now with $p$ processes each needing a maximum of $m$ resources and a total of $r$ resources available. What condition must hold to make the system deadlock free?
in Operating System 67 views

1 Answer

0 votes
We allocate all process with $m-1$ resources (one less than maximum requirement ).

So if we have $p*(m-1)$ resources we can have deadlock. When we have one more resource its guaranteed to be deadlock free.

So $ r ≥ p(m − 1) + 1$

Related questions

2 votes
0 answers
1
0 votes
2 answers
2
0 votes
1 answer
3
72 views
The banker’s algorithm is being run in a system with $m$ resource classes and $n$ processes. In the limit of large $m$ and $n,$ the number of operations that must be performed to check a state for safety is proportional to $m^{a} n^{b}.$ What are the values of $a$ and $b?$
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 72 views
...