Consider the following two periodic tasks (with the same request time)

• Task T1: c1 = 4, t1 = 9

• Task T2: c2 = 6, t2 = 14

(a) Determine the total utilization of these two tasks and compare it with Liu and Layland’s least upper bound for the fixed priority schedule. What conclusion can you derive?

(b) Show that these two tasks are schedulable using the rate-monotonic priority assignment. You are required to provide such a schedule.

(c) Determine the schedulability of these two tasks if task T2 has a higher priority than task T1 in the fixed priority schedule.

(d) Split task T2 into two parts of 3 units computation each and show that these two tasks are schedulable using the rate-monotonic priority assignment.

(e) Provide a schedule (from time unit 0 to time unit 30) based on deadline driven scheduling algorithm. Assume that the smallest preemptive element is one unit.