[理工] [OS] multilevel queue scheduling
恐龍習題
Consider a system implementing multilevel queue scheduling.What strategy
can a computer user employ to maximize the amount of CPU time allocated
to the user's process?
Ans : The program could maximize the CPU time allocated to it by not
fully utilizing its time quantums.It could use a large fraction of
its assigned quantum,but relinquish the CPU before the end of the
quantum,thereby increasing the priority associated with the process.
我想問解答部分應該是說像feedback queue這種因為無法一次執行完工作
然後會提高優先權而移到其他queue裡面的這種情況吧?
可是題目是說multilevel queue，可以在單一queue裡面提高優先權然後
在下一次工作給予較大的quantum嗎?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.37.178.177
討論串 (同標題文章)
以下文章回應了本文：
完整討論串 (本文為第 1 之 2 篇)：