![subject](/tpl/images/cats/informatica.png)
Computers and Technology, 23.04.2020 22:41 igsgymnast
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.
![ansver](/tpl/images/cats/User.png)
Answers: 2
![](/tpl/images/ask_question.png)
![](/tpl/images/ask_question_mob.png)
Other questions on the subject: Computers and Technology
![image](/tpl/images/cats/informatica.png)
![image](/tpl/images/cats/informatica.png)
Computers and Technology, 21.06.2019 17:20, sharperenae463
What do you need to know & understand about global expansion.
Answers: 2
![image](/tpl/images/cats/informatica.png)
Computers and Technology, 22.06.2019 07:00, candiceforever123
Idon understand these and need some ! ?
Answers: 2
You know the right answer?
Consider a computer with two processes, H, with high priority, and L, with low priority. The schedul...
Questions in other subjects:
![Konu](/tpl/images/cats/geografiya.png)
![Konu](/tpl/images/cats/mat.png)
![Konu](/tpl/images/cats/mat.png)
Mathematics, 27.09.2020 22:01
![Konu](/tpl/images/cats/mat.png)
![Konu](/tpl/images/cats/biologiya.png)
Biology, 27.09.2020 22:01
![Konu](/tpl/images/cats/biologiya.png)
![Konu](/tpl/images/cats/fizika.png)
![Konu](/tpl/images/cats/biologiya.png)
![Konu](/tpl/images/cats/himiya.png)
![Konu](/tpl/images/cats/mat.png)
Mathematics, 27.09.2020 22:01