Let's consider a task set composed by $4$ tasks: $T1=(1,5),T2=(2,6),T3=(2,9)$ and $T4=(4,10),$ where the

numbers within the parenthesis are the Worst Case Computation Time $($WCET$),$ the task period, respectively.

Using the schedulability tests presented in the course, what can you say regarding the schedulability of

the task set?

Is the task set schedulable with Rate Monotonic $($RM$)?$

Is the task set schedulable with Earliest Deadline First $($EDF$)?$

Determine the schedule generated using RM$.$ Fill the boxes with the index of the executing task for each time

instant. For example, if task $T2$ is executing in the time slot beginning at $t=5($i$.$e$.,$ between time $5$ and $6),$ fill

the box labelled with $05$ with the number $2.$ If the processor is idle $($no task is executing in the given time

slot$),$ fill the box with the number $0($which is zero, but please insert the numerical value in the box$).$

If a job of a task can not be completed due to the preemption from higher priority tasks, just start the next job

of the uncompleted task, leaving a partial execution of the preempted, uncompleted job.

SUGGESTION: draw the schedules on a paper, and then fill the boxes.

Insert here the schedule generated by RM: