Discuss, Learn and be Happy דיון בשאלות

help brightness_4 brightness_7 format_textdirection_r_to_l format_textdirection_l_to_r

An edge from process Pi to Pj in a wait for graph indicates that

1
done
by
מיין לפי

If the wait for graph contains a cycle

1
done
by
מיין לפי

What is the disadvantage of invoking the detection algorithm for every request?

1
done
by
מיין לפי

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify

1
done
by
מיין לפי

A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?

1
done
by
מיין לפי

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock

1
done
by
מיין לפי

‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock

1
done
by
מיין לפי

A deadlock can be broken by

1
sentiment_very_satisfied
by
מיין לפי

The two ways of aborting processes and eliminating deadlocks are

1
done
by
מיין לפי

What is the solution to starvation?

1
done
by
מיין לפי