Consider the following periodic task-set Task Period Deadline Execution Time 1 3 3. 1 8 8....

Transcribed Image Text:

Consider the following periodic task-set Task Period Deadline Execution Time 1 3 3. 1 8 8. 4 9. 9. 1 Determine the feasible cyclic executive schedule by answering the following sub-questions. Provide proper explanation for your answers: 1. (2) Test if the given task-set is schedulable under RM, using the sufficient test 2. (8) Test if the given task-set is schedulable under RM, using the necessary test. 3. (5) Assume that the first job of each task arrives at time 0. Construct the schedule for the interval [0, 20] and illustrate it graphically. In case they exist, identify deadline misses. 4. (3) Determine the maximum utilization which is always scheduleable using RM scheduling, using the sufficient schedulability test. Consider the following periodic task-set Task Period Deadline Execution Time 1 3 3. 1 8 8. 4 9. 9. 1 Determine the feasible cyclic executive schedule by answering the following sub-questions. Provide proper explanation for your answers: 1. (2) Test if the given task-set is schedulable under RM, using the sufficient test 2. (8) Test if the given task-set is schedulable under RM, using the necessary test. 3. (5) Assume that the first job of each task arrives at time 0. Construct the schedule for the interval [0, 20] and illustrate it graphically. In case they exist, identify deadline misses. 4. (3) Determine the maximum utilization which is always scheduleable using RM scheduling, using the sufficient schedulability test.