[理工] [OS] CPU Scheuduling

[Lautreamont (Maldoror is dead)]

Consider a preemptive priority scheduling algorithm based on
dynamically changing priorities. Larger priority numbers imply
higher priority. When a process is waiting for the CPU (in the
ready queue, but not running), its priority changes at a rate α;
when it is running, its priority changes at a rate β. All processes
are given a priority of 0 when they enter the ready queue.
The parametersαandβcan be set to give many different scheduling
algorithms.
a. What is the algorithm that results fromβ>α> 0?
b. What is the algorithm that results from α<β< 0?

Answer:
a. FCFS
b. LIFO

請問這一題要怎麼看??

謝謝。

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 220.136.244.169
→ bensome0624:b小題題目確定是α<β< 0而不是α>β>0 ?
→ bensome0624:我想錯了,b小題題目沒錯,因為優先權會越來越低,故反而
→ Lautreamont:是的 這是恐龍的題目  我也很納悶怎麼會有負的
→ bensome0624:剛進入的程序可以取得CPU,且優先權下降較慢,是LIFO
→ Lautreamont:所以其實根本不用看β，只要看0與α的關係嗎?
推 dendrobium:都要喔看~