Outline:

1. EDD
   • remainder of swapping proof
   • feasibility test
   • more about optimality
2. Allowing arbitrary arrivals (asynchronous tasks)
   • problem statement and task model
   • EDF algorithm

Reading assignment (to be completed by the next class):

What you should understand after today:

• Buttazzo section 3.3 (pp. 49–54)

Corrections in book:

• p. 50, paragraph after Theorem 3.2:
  • With a list, it is O(n) per task; with a heap, it is only O(log n) per task.
• p. 53, table:
  • The values of a₃ and a₄ are swapped.