这是恐龙第八版的习题 (ch5 process scheduling)
5.16
Consider a preemptive priority scheduling algorithm based on dynamically
changing priority. Larger priority numbers imply higher priority.
When a process is waiting for the CPU (in the ready, but not running), its
priority changes at rate A; when it is running. its priority changes at a rate
B. All processes are given a priority of 0 when they enter the ready queue.
The parameter A and B can be set to give many different scheduling algorithm.
a. What is the algorithm that result form B > A > 0 (A : FCFS)
b. What is the algorithm that result form A < B < 0 (A : LIFO)
另外题库还有
c. What is the algorithm that result form A > B > 0 (A : LIFO)
d. What is the algorithm that result form B < A < 0 (A : FCFS)
a和b 没问题
其他都不太了解为什么，像 A > B > 0
刚进入Ready queue的为0，原先在Ready queue和Runing的priority应该都较高
为何答案却是 LIFO
而 B < A < 0
就更不懂了，烦请大家解惑，感谢