How is the method of breaking the \"hold and wail\" deadlock condition similar w

Question

How is the method of breaking the "hold and wail" deadlock condition similar with breaking the "preemption" condition for deadlock prevention? both methods may force a process to wait for all resources it needs before it can start both methods may lead to starvation neither actually prevents deadlock when used alone both methods rely on a process knowing beforehand what resources it will need in the future The resource-allocation graph for deadlock avoidance is G = (P, R, E), P = (P1, P2, P3), R = (R1, R2, R3), E = (P2 rightarrow R_3, P3 rightarrow R1, R2 rightarrow P2, P3 rightarrow R3, R1 rightarrow P2) and the claim edge P1 rightarrow R1. All resource are of the same type. What is true about the system at this point? the system is in an unsafe state due to the claim edge P1 rightarrow R1 deadlock is not possible the claim edge can be granted with no deadlock danger system is in deadlock What method for dealing with deadlocks ensures that at least one of the necessary conditions for deadlock cannot hold? deadlock detection deadlock prevention deadlock recovery deadlock avoidance What is not a necessary condition that must hold in a deadlocked system? Circular wait Mutual exclusion No preemption Hold and wait Synchronized access

Explanation / Answer

13.Answer: Both methods lead to starvation.

15.Answer: Deadlock prevention

16.Answer: Synchronised acess

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.