2. A periodic task-set as shown in Table 3 is to be scheduled on a preemptive processor. In addition, a job J with unkno
Posted: Fri Jul 01, 2022 5:43 am
2. A periodic task-set as shown in Table 3 is to be scheduled on a preemptive processor. In addition, a job J with unknown arrival time and computation time of 5 units needs to be scheduled on the processor. Task TI 22 Computation Time 1 2 A periodic task-set Period 4 5 Deadline 4 5 a) (3 points) Assume Rate Monotonic (RM) scheduling for the periodic tasks, while job J is served by a polling server with period TS = 3 and computation time CS=0.5. What is the smallest relative deadline that J can always satisfy? b) (6 points) Assume EDF scheduling for the periodic tasks, while job J is served by a total bandwidth server. What is the smallest relative deadline that J can always satisfy such that the periodic tasks are also schedulable?