作者sky810675 (KKMAN)
看板TransCSI
標題[問題] process
時間Sun Sep 5 11:14:23 2010
Consider two processes P1 and P2, where the periods are p1 = 50 and p2 = 75
and the processing times are t1 = 25 and t2 = 30, respectively. Schedule the
two processes using the following algorithms and illustrate their executions
using Gantt charts.
CPU time periods
P1 25 50
P2 30 75
1.Rate-monotonic scheduling
2.Earliest deadline first
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.171.55.250