Outline:

1. Quiz 2
2. Classifying scheduling algorithms
3. Periodic tasks
4. EDF for implicit-deadline periodic tasks
   • example
   • guarantee test

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

What you should understand after today:

• Buttazzo section 2.3 (pp. 28–35)
• Buttazzo section 4.1 intro (pp. 69–71)
• Buttazzo section 4.4 (pp. 88–91)

Corrections in book:

• p. 90, equation (4.15):
  • The second equality should be ≤ rather than =.

Paper to read for Friday:

• “Hardware Compute Partitioning on NVIDIA GPUs” (Bakita et al.)