[理工] [OS]-CPU Scheuduling

看板Grad-ProbAsk作者Lautreamont (Maldoror is dead)時間14年前 (2010/03/07 22:25)推噓1(1推 0噓 5→)

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

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

03/07 22:34, , 1^F

03/07 22:34, 1^F

→

bensome0624

03/07 22:51, , 2^F

03/07 22:51, 2^F

→

Lautreamont

03/07 22:51, , 3^F

03/07 22:51, 3^F