Task Scheduling Analysis: Earliest Due Date and Deadline First Algorithms Comparison

Question 1.

Consider the following set of tasks, each of which arrive at time t=0. Determine a schedule
using the Earliest Due Date scheduling algorithm. State whether or not the schedule is feasible. State
the maximum lateness for the resulting schedule.

Question 2.

Consider the following set of tasks, each of which arrive at time t=0. Determine a schedule
using the Earliest Due Date scheduling algorithm. State whether or not the schedule is feasible. State
the maximum lateness for the resulting schedule.

Question 3.

Consider the following set of tasks, with arrival times as shown. Determine a schedule using
the Earliest Deadline First scheduling algorithm. State whether or not the schedule is feasible. State the
maximum lateness for the resulting schedule. Note that no pre-emption occurs with this schedule. Why
does that happen for this example?

Question 4.

Consider the following set of tasks, with arrival times as shown. Determine a schedule using
the Earliest Deadline First scheduling algorithm. State whether or not the schedule is feasible. State the
maximum lateness for the resulting schedule.

Question 7.

This problem compares RM and EDF schedules. Consider two tasks with periods T1 = 2 and
T2 = 3 and computation times C1 = C2 = 1. Assume that the deadline for each execution is the end of the
period.
(a) Give the RM schedule for this task set and find the processor utilization. How does this utilization
compare to the utilization bound given in the lecture notes?

(b) Show that any increase in C1 or C2 makes the RM schedule infeasible. If you hold C1 = C2 = 1 and p2
= 3 constant, is it possible to reduce T1 below 2 and still get a feasible schedule? By how much? If you
hold C1 = C2 = 1 and T1 = 2 constant, is it possible to reduce T2 below 3 and still get a feasible schedule?
By how much?

(c) Increase the execution time of task 2 to be C2 = 1.5, and give an EDF schedule. Is it feasible? What is
the processor utilization?

Are you struggling to keep up with the demands of your academic journey? Don't worry, we've got your back!
Exam Question Bank is your trusted partner in achieving academic excellence for all kind of technical and non-technical subjects. Our comprehensive range of academic services is designed to cater to students at every level. Whether you're a high school student, a college undergraduate, or pursuing advanced studies, we have the expertise and resources to support you.

To connect with expert and ask your query click here Exam Question Bank