Prove Equation (2.26) solution

Given a set of periodic tasks t₁ t₂ ... t_m with repetition periods T₁ < T₂ < ... < T_m and run times C₁ C₂ ...C_m . solution
(a) What is the deadline driven schedule and when such a schedule is feasible?
(b) Given that T₁= 1, T₂ = 2.5, T₃ = 6 and c₁ = 0.5, c₂ = 1.01, c₃ =0.5, can these tasks be scheduled according to the rate monotonic scheduling? solution

Consider a Real Time system where three tasks , , and are competing for the processor. Assume that T₁= 2, T₃= 4, C₁=C₃= 1. Find the values of T₂ and C₂ which maximize the processor utilization factor. Assume rate monotonic scheduling and that T₁ < T₂ < T₃. solution