Re: [理工] [OS]-rate monotonic

看板Grad-ProbAsk作者bjk (Up2u)時間14年前 (2012/02/07 19:59)推噓2(2推 0噓 5→)

留言7則, 4人參與討論串2/2 (看更多)

http://en.wikipedia.org/wiki/Rate-monotonic_scheduling The rate monotonic priority assignment is optimal meaning that if any static priority scheduling algorithm can meet all the deadlines, then the rate monotonic algorithm can too. The deadline-monotonic scheduling algorithm is also optimal with equal periods and deadlines, in fact in this case the algorithms are identical; in addition, deadline monotonic scheduling is optimal when deadlines are less than periods.[4] even period time cpu time p1 50 25 p2 80 35 rate monotonic不可排 EDF(earliest-deadline first)可以排我好像有聽說rate monotonic不可排，那其他排班法則也都不可排能否解是一下 -- When we toss a coin , we obtain either head or tail. Now we toss a coin 5 times. There are 2^5 possible outcomes. How many of them contain no two consecutive heads? -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 203.70.50.18

→

metalalive

02/07 20:23, , 1^F

02/07 20:23, 1^F

→

metalalive

02/07 20:28, , 2^F

02/07 20:28, 2^F

我是想問說這個例子 rate monotonic不可排 EDF(earliest-deadline first)可以排但是我聽說只要，rate monotonic不可排，那就沒有排班法則可以排了 ※ 編輯: bjk 來自: 203.70.50.18 (02/07 20:54)

推

rayway30419

02/07 20:58, , 3^F