Lesson 17: The Challenge of Multicore Scheduling; Pfair

Outline:

  1. Why multicore scheduling is challenging
    • recap: bin packing
    • global scheduling
    • the Dhall Effect
    • scheduling anomalies without migrations
  2. Processor-sharing scheduling
    • Pfair
  3. Course project overview
    • scope and goals
    • deliverables and deadlines
    • project ideas

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

  • Dhall, Sudarshan K., and Chung Laung Liu. “On a real-time scheduling problem.” Operations research 26, no. 1 (1978): 127-140.
    • Sec. 3, p. 131
  • Goossens, Joël, Shelby Funk, and Sanjoy Baruah. “Priority-driven scheduling of periodic task systems on multiprocessors.” Real-time systems 25, no. 2-3 (2003): 187-205.
    • Sec. 1.1 (overview of Pfair)
  • Baruah, Sanjoy K., Neil K. Cohen, C. Greg Plaxton, and Donald A. Varvel. “Proportionate progress: A notion of fairness in resource allocation.” Algorithmica 15, no. 6 (1996): 600-625.
    • Abstract, Sec. 1 (introduction), Sec. 2 (notation and definitions), and Sec. 6 (conclusion)