A periodic task i with phase i , period pi , execution time ei , and relative deadline Di is represented by the 4-tuple (i,

A periodic task τi with phase φi , period pi , execution time ei , and relative deadline Di is represented by the 4-tuple (φi, pi, ei,Di ) . For example, (1, 10, 3, 6) is a periodic task whose phase is 1, period is 10, execution time is 3, and relative deadline is 6. Using this notation, consider the following problem. The total utilization of the period task (7, 10, 1, 10), (0, 12, 6, 12), (0, 25, 9, 25) is 0.96. Is it schedulable by the rate-monotonic algorithm? Draw the rate-monotonic schedule. 

Ti 141 72 73 ri ei 1 - - 1 E Pi 3 5 10