Question: To ensure that the hold-and-wait condition never occurs in the system In Deadlock Prevention Scheme,which of the following is the major disadvantages of the protocol used. <ol> <li>Swapping</li> <li>resource utilization may be low,</li> <li>starvation</li> <li>page fault</li> </ol>
Answer:
First, resource utilization may be low, since resources may be allocated but unused for a long period.
In the example given, for instance, we can release the DVD drive and disk file, and then request the disk file and printer, only if we can be sure that our data will remain on the disk file. Otherwise, we must request all resources at the beginning for both protocols.
Second, starvation is possible. A process that needs several popular resources may have to wait indefinitely, because at least one of the resources that it needs is always allocated to some other process.
MCQ: To ensure that the hold-and-wait condition never occurs in the system In Deadlock Prevention Scheme,which of the following is the major disadvantages of the protocol used. <ol> <li>Swapping</li> <li>resource utilization may be low,</li> <li>starvation</li> <li>page fault</li> </ol>
Explanation:
First, resource utilization may be low, since resources may be allocated but unused for a long period.
In the example given, for instance, we can release the DVD drive and disk file, and then request the disk file and printer, only if we can be sure that our data will remain on the disk file. Otherwise, we must request all resources at the beginning for both protocols.
Second, starvation is possible. A process that needs several popular resources may have to wait indefinitely, because at least one of the resources that it needs is always allocated to some other process.
Discuss a Question
Related Questions
- 1. The third necessary condition for deadlocks is that there be no preemption of resources that have already been allocated. To ensure that this condition does not hold, Which of the following protocol should be used.
- 2. If a process is holding some resources and requests another resource that cannot be immediately allocated to it (that is, the process must wait), then all resources the process is currently holding are preempted.This protocol is often applied to resources like <ol> <li>CPU register</li> <li>memory space</li> <li>mutex locks</li> <li>semaphores</li> </ol>
- 3. The fourth and final condition for deadlocks is the circular-wait condition. One way to ensure that this condition never holds .Which of the following protocol should be used. <ol> <li>a process requesting an instance of resource type Rj must have released any resources Ri such that F(Ri) ≥ F(Rj).</li> <li>protocol allows a process to request resources only when it has none. A process may request some resources and use them. Before it can request any additional resources, it must release all the resources that it is currently allocated.</li> <li>If a process is holding some resources and requests another resource that cannot be immediately allocated to it (that is, the process must wait), then all resources the process is currently holding are preempted</li> <li>Each process can request resources only in an increasing order of enumeration. That is, a process can initially request any number of instances of a resource type —say, Ri. After that, the process can request instances of resource type Rj if and only if F(Rj) > F(Ri).</li> </ol>
- 4. Prevent deadlocks by limiting how requests can be made. The limits ensure that at least one of the necessary conditions for deadlock cannot occur. Possible side effects of preventing deadlocks by this method are: <ol> <li>Low device utilization</li> <li>Reduced system throughput.</li> <li>Starvation</li> <li>Page fault</li> </ol>
- 5. An alternative method for avoiding deadlocks is
- 6. avoiding deadlocks is to require additional information about how resources are to be requested .In order to avoid a possible future deadlock which of the following information is required?
- 7. avoiding deadlocks ,The simplest and most useful model requires that each process declare the ____ of resources of each type that it may need
- 8. A deadlock-avoidance algorithm dynamically examines the ____ to ensure that a circular-wait condition can never exist.
- 9. In A deadlock-avoidance algorithm The resource allocation state is defined by
- 10. In A deadlock-avoidance algorithm A state is safe if
You may be interested in:
OS Deadlocks MCQsRecently Added Articles
How Can AI Simplify the Academic Life of Students?
Last updated on: April 16, 2025Posted by: ExamRadar
Want to Clear IBPS RRB PO? Master These Mock Test Hacks!
Last updated on: March 10, 2025Posted by: ExamRadar
Top AI Tools for Instantly Detecting Plagiarized Writing
Last updated on: December 5, 2024Posted by: ExamRadar
Applying Algorithmic Trading Techniques to Forex: Insights for Programmers and Data Scientists
Last updated on: November 22, 2024Posted by: ExamRadar
Image to Text Conversion Made Easy: Online Tool Insights
Last updated on: April 12, 2024Posted by: ExamRadar
