Outline:

1. Recap: NPP
2. Blocking and schedulability
3. Highest Locker Priority (HLP) protocol
   • Overview
   • Blocking computation

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

• Schedulability tests with blocking terms: Buttazzo sec. 7.9 (pp. 246-247)
• HLP: Buttazzo sec. 7.5 (pp. 212-214)

Corrections in book (section 7.9 – Schedulability Analysis):

• p. 246, equation (7.22):
  • The calculation for must include the WCET of all higher-priority tasks as well:

Corrections in book (section 7.5.1 – HLP Blocking Time Computation):

• p. 214, proof of Theorem 7.1:
  • The statement in the second-to-last sentence should be that