Lesson 2: Scheduling Independent Synchronous Aperiodic Tasks (EDD)

Outline:

  1. Recap
  2. Evaluating scheduling algorithms
  3. Scheduling independent synchronous aperiodic tasks
    • problem statement
    • EDD algorithm
    • proof of optimality (swapping proof)
  4. Assignment: W1
  5. Papers listed online - see Slack for preference form

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

What you should understand after today:

  • Buttazzo sections 2.1–2.2 (pp. 19–28)
  • Buttazzo sections 3.1–3.2 (pp. 45–49)

Skim for the future:

  • Buttazzo section 2.3 (pp. 28–35)