Problem
Consider the following 5 task set T(e,d) T1(2,3), T2(3,11), T3(4,13), T4(5,18) and T5(4,17). Task T1 starts at 0 and the algorithm is non-work conserving. The time slice of the above task set is 2 units. Schedule the above tasks on processor P1 using non-weighted round robin method. Derive a non-work conserving schedule. Compute the make span of the schedule.