Real-time scheduling

Consider the set of tasks T1=(4,1), T2=(5,2) and T3=(7,2) In the lecture we proved the following results: - T1, T2, T3 is not schedulable with Rate Monotonic (RM) - T1, T2, T3 is schedulable with Earliest Deadline First (EDF).

Q1. What is the condition for a set of tasks T1, T2, ..., Tn to be schedulable under RM?

Q2. Let T1'=(4,2). Is T1', T2, T3 schedulable under RM? If your answer is "no", Provide a time diagram (x-axis = time, y-axis = the tasks) to show that under RM, one task will miss its deadline and clearly state which task misses its deadline.

Q3. Let T4(m)=(m,2). What is the lowest m such that T1, T2, T4(m) is schedulable with RM?

Q4. Let T5(k)=(7,k). What is the smallest k such that T1, T2, T5(k) is not shedulable with EDF?

Q5. Is the following statement true or false: if a set S of tasks cannot be scheduled with EDF, then there is no scheduler that can schedule S.