作者assassin88 (2010)
看板Grad-ProbAsk
標題[理工] [OS]-rate monotonic
時間Tue Jan 19 23:45:12 2010
Consider two processes P1 and P2 where period P1 = 50, processing time t1 = 25
and period P2 = 75, processing time t2 = 30. Can these two peocesses be
schedule using rate-monotonic scheduling? Illustrate your answer using a
Gantt chart.
請問這一題該怎麼解？題目完全看不懂= =
且 rate-monotonic 在哪一個章節有提到？
麻煩指導~感謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.57.104.57
1F：推 killerjoe:在real time system那一章 01/19 23:57
2F：→ killerjoe:是用在schedule real time process的 01/19 23:58
3F：→ assassin88:那請問這題有解嗎? 01/20 00:01
4F：→ Nandesga:答案是不能schedule 01/20 00:02
5F：→ assassin88:請問要怎麼看的?? 01/20 00:08
6F：→ killerjoe:恐龍7th 19.5.1 01/20 00:16
7F：推 jwcs:不能Schedule, 畫畫看 Gantt chart 大概就知道了 01/20 08:22
8F：推 RoddickJoe:rate-Monotonic的簡單定義就是period越短的優先權越大 01/22 03:14
9F：→ assassin88:這題我會了~感謝 01/22 23:21