Outline:

1. Constrained deadlines and non-optimality of RM
2. Deadline-monotonic scheduling
   • sufficient test: density-based
   • sufficient test: interference
   • exact test: Response-Time Analysis (RTA)

Explore after class (optional):

• Exact test: Workload analysis (Buttazzo section 4.5.4)
• Cool complexity proof using both DBF and RTA: “Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard” by Pontus Ekberg and Wang Yi (see Pontus’s website for the paper and slides)

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

What you should understand after today:

• Buttazzo section 4.5-4.5.3 (pp. 91–98)

Paper to read for Friday:

• “Limited Preemption EDF Scheduling of Sporadic Tasks Systems” (Bertogna and Baruah)