问一个买房子counter-offer 的问题 (转载)# Living
z*i
1 楼
在Operating.Systems.Design.and.Implementation书上， 2.2.4 有一段话
Consider a computer with two processes, H, with high priority and L, with
low priority, which share a critical region. 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 while
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.
所以这是两个process的情况
http://en.wikipedia.org/wiki/Priority_inversion
wiki上是3个process的情况
到底哪个是对的？ 谢谢 面试的时候碰到了，答了课上学的2个process的，对方说错
了。
Ps:回来查书，可不可以给那两个面试官发信，说我答的是课本上的答案？
Consider a computer with two processes, H, with high priority and L, with
low priority, which share a critical region. 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 while
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.
所以这是两个process的情况
http://en.wikipedia.org/wiki/Priority_inversion
wiki上是3个process的情况
到底哪个是对的？ 谢谢 面试的时候碰到了，答了课上学的2个process的，对方说错
了。
Ps:回来查书，可不可以给那两个面试官发信，说我答的是课本上的答案？
