1. A periodic task-set is to be scheduled on a preemptive processor under Earliest Deadline First...

Transcribed Image Text:

1. A periodic task-set is to be scheduled on a preemptive processor under Earliest Deadline First (EDF). For a periodic task , denote its computation time with Ci, period with L. and relative deadline with Di. Assume that the first release of each task occurs at time zero. Task TI 22 T3 Computation Time Period 1 4 1 2 2 8 A periodic task-set Deadline 3 a) (4 points) Construct the preemptive EDF scheduling diagram 2 8 b) (2 points) A periodic task-set with constrained deadlines (i.e. Di≤Ti, Vui) is schedulable [Ci Di≤ 1. Does the task-set pass this sufficient schedulability test? 1. A periodic task-set is to be scheduled on a preemptive processor under Earliest Deadline First (EDF). For a periodic task , denote its computation time with Ci, period with L. and relative deadline with Di. Assume that the first release of each task occurs at time zero. Task TI 22 T3 Computation Time Period 1 4 1 2 2 8 A periodic task-set Deadline 3 a) (4 points) Construct the preemptive EDF scheduling diagram 2 8 b) (2 points) A periodic task-set with constrained deadlines (i.e. Di≤Ti, Vui) is schedulable [Ci Di≤ 1. Does the task-set pass this sufficient schedulability test?