[理工] [OS] CPU scheduling

看板Grad-ProbAsk作者marvintim77 (小銘)時間15年前 (2011/03/10 17:42)推噓4(4推 0噓 5→)

留言9則, 6人參與討論串1/4 (看更多)

Consider the following preemptive priority-scheduling algorithn 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 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 parameters A and B can be to give many different scheduling Algorithms. (a) What is the algorithm that result from B > A > 0. (b) What is the algorithm that result from A < B < 0. 我知道答案(a)LIFO (b)FCFS 但我不明白為什麼是這樣照題目給的 B的優先權值應該會恆大於A 所以兩個都解釋成FCFS也行的通吧難道是我誤會了什麼嗎？有請大大解答謝謝 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 114.27.133.68

推

eddie780217

03/10 18:16, , 1^F

03/10 18:16, 1^F

→

xygod

03/10 18:47, , 2^F

03/10 18:47, 2^F

推

compulsory

03/10 18:50, , 3^F

03/10 18:50, 3^F