0 votes 0 votes 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? Operating System tanenbaum operating-system deadlock-prevention-avoidance-detection descriptive + – admin asked Oct 30, 2019 admin 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 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$ smsubham answered Mar 16, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.