Outline:

1. Non-preemptive scheduling
   • non-optimality of EDF
   • search tree of possible schedules
2. Two approaches to reduce search space
   • pruning: Bratley’s Algorithm
   • heuristics: Spring Algorithm
3. Paper discussions: First one Friday!

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

What you should understand after today:

• Buttazzo section 3.4 (pp. 54–60)

Paper to read for Friday:

• “IDK Cascades for Time-Series Input Streams” (Agrawal et al.)