Assignments

Homework assignment #2: Fixed-priority preemptive scheduilng of periodic task systems

 

Consider the following set of implicit-deadline periodic tasks.

ipiei
162
283
3123
  1. Draw a Gantt chart of the non-preemptive rate-monotonic schedule for this set of tasks. (10 pt)
  2. Draw a Gantt chart of the preemptive rate-monotonic schedule for this set of tasks. (10 pt)
  3. Draw a Gantt chart of the non-preemptive earliest-deadline-first (EDF) schedule for this set of tasks. (10 pt)
  4. Draw a Gantt chart of the preemptive EDF schedule for this set of tasks. (10 pt)
  5. Use the method of Lemma 6.6 in Jane Liu's book (iterative computation of a least-fixed-point solution of the recurrence) to compute the worst-case response time of each of the tasks, under fixed-task-priority scheduling. (10 pt)
T. P. Baker.($Id)