Consider a computer with two processes, H, with high priority, and L, with low p

Question

Consider a computer with two processes, H, with high priority, and L, with low priority. The scheduling rules are such that H is run whenever it is in ready state. At a certain moment, with L in its critical region, H becomes ready to run (e.g., an I/O operation completes). H now begins busy waiting, but since L is never scheduled with H is running, L never gets the chance to leave its critical region, so H loops forever. This situation is sometimes referred to as the priority | inversion problem. If instead of priority scheduling, we use round-robin scheduling. Will we encounter the same problem? Please explain your answer in detail.

Explanation / Answer

Priority inversion is a scheduling situation in which higher priority task gets preempted by lower priority task. This is one of the main problem in priority scheduling

If we use Round Robin scheduling we will never encounter the priority inversion problem. As ,in Round Robin scheduling the process generally use a certain amount of time or time slices for each processes before it is force to wait for the next process.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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