Your task is to decide if a hard real time system with given tasks is schedulable.

$($All time are in microseconds$)$

Task name Task service time Task period$/$

Request frequency

Task deadline from

time of request

A $205030$

B $207040$

C $5010070$

a$.$ Is it schedulable using Rate Monotonic Scheduling $($RMS$)?$ Ignore task switch delays

$($Follow notes$/$ slides$).$

b$.$ Please show the timing diagram using RMS scheduling till fully servicing at least $2$

requests of C$.$ The timing diagram must highlight all met and$/$ or missed deadlines.

c$.$ Does schedulability change if A$,$B and C deadlines are changed to $40,50$ and $90,$

respectively $?$

d$.$ Please show an EDF timing diagram for part c$.$

e$.$ Does schedulability change if A$,$ B and C periods are changed to $60,80$ and $120,$

respectively $?$ Deadlines are same as original $($Not continuation of part c$)$

f$.$ Please show a deadline monotonic scheduling timing diagram for part e$.$

g$.$ Referring back to the original table, can you make it schedulable if you are only

allowed to change the period of any one task $?$ Please show your reasoning and work.

h$.$ Referring back to the original table, can you make it schedulable if you are only

allowed to change the deadline of any one task $?$ Please remember that the deadline

cannot be longer than the period. Please show your reasoning and work.