Daily Schedule

Uniprocessor Scheduling Algorithms

Jan. 06: Lesson 1 - Intro to Intro to Real-Time Systems
Jan. 08: Lesson 2 - Scheduling Independent Synchronous Aperiodic Tasks (EDD)
Jan. 10: Lesson 3 - Scheduling Independent Asynchronous Aperiodic Tasks (EDF)
Jan. 13: Lesson 4 - EDF for Independent Asynchronous Aperiodic Tasks, cont'd
Jan. 15: Lesson 5 - Non-Preemptive Scheduling
Jan. 20: Lesson 7 - Periodic Tasks and EDF
Jan. 22: Lesson 8 - EDF with Constrained Deadlines
Jan. 27: Lesson 10 - Task-Level Fixed-Priority Scheduling
Jan. 29: Lesson 11 - Fixed Priorities with Constrained Deadlines

Uniprocessor Locking Protocols

Feb. 03: Lesson 13 - Resource Access Protocols (NPP)
Feb. 05: Lesson 14 - Priority Ceilings and Priority Inheritance (HLP, PIP)
Feb. 12: Lesson 16 - The Priority Ceiling Protocol (PCP)

Multiprocessor Scheduling Algorithms

Feb. 19: Lesson 19 - Partitioning and Hard Problems
Feb. 24: Lesson 21 - The Challenge of Multicore Scheduling
Feb. 26: Lesson 22 - Global EDF Schedulability
Mar. 03: Lesson 24 - Federated Scheduling

Multiprocessor Locking Protocols

Mar. 10: Lesson 27 - Multiprocessor Nested Locking
Mar. 12: Lesson 28 - Locking via Concurrency Groups

Other

Feb. 17: Lesson 18 - Proposal Presentations

Paper Discussions

Starting in Week 2, we will spend Friday class periods discussing recent research papers. We'll discuss this more in class, and student-led discussions won't start until Week 3. Make sure to read instructions for discussion leaders and discussion participants.

Jan. 17: Lesson 6 - IDK Cascades   (click for paper PDF)
Jan. 24: Lesson 9 - NVIDIA GPU Internals   (click for paper PDF)
Jan. 31: Lesson 12 - Limited-Preemption EDF Scheduling   (click for paper PDF)
Feb. 07: Lesson 15 - Lightweight Synchronization under P-EDF   (click for paper PDF)
Feb. 14: Lesson 17 - Message Synchronization in ROS 2   (click for paper PDF)
Feb. 21: Lesson 20 - Fixed-Priority Sensitivity Analysis   (click for paper PDF)
Feb. 28: Lesson 23 - Analysis of a Holoscan Application   (click for paper PDF)
Mar. 07: Lesson 26 - Fault-Tolerant Message Transmission   (click for paper PDF)

Calendar view

Calendar

Quizzes

There will be a (very short) quiz at the start of most weeks. You can find a topic list below to help you prepare; these quizzes are meant to test fundamental skills, and not to be tricky.

  • Q1 (Monday Jan. 13): Draw the schedule for a set of aperiodic tasks using EDF; explain a scheduling anomaly
  • Q2 (Monday Jan. 20): Perform the EDF guarantee test for aperiodic tasks; provide a valid non-preemptive schedule for aperiodic tasks
  • Q3 (Monday Jan. 27): Perform the EDF utilization/density-based test(s); draw the schedule for a set of periodic tasks using EDF
  • Q4 (Monday Feb. 3): Perform the EDF DBF test; draw the schedule for a set of periodic tasks using RM/DM
  • Q5 (Monday Feb. 17): Perform DM RTA test (without blocking); compute blocking for NPP and/or PCP
  • Q6 (Monday Feb. 24): Perform the EDF utilzation test with blocking; partition tasks using P-EDF
  • Q7 (Monday Mar. 3): Draw the schedule for global scheduling (G-EDF/G-RM/G-DM); explain the Dhall Effect