Using SCHED_DEADLINE
summary
Linux 3.14 adds SCHED_DEADLINE, implementing EDF plus the CBS and new syscalls (sched_setattr) that accept runtime/deadline/period in nanoseconds; code samples and C tools include cyclic_deadlines and a deadline test that measure jitter. Practical notes: sub-millisecond periods need HR-tick enabled; kernel rejects attribute sets that violate math constraints. Limits: global EDF on SMP cannot guarantee >1× utilization for all cases, partitioning is NP‑complete, deadline tasks are bound to all CPUs and cannot fork. A greedy reclaim patch (grub) lets tasks borrow unused bandwidth; patches are in progress.
AI-written summary · about
chapters (16)
- 0:00Using SCHED DEADLINE
- 1:59What is SCHED DEADLINE?
- 4:15Other Schedulers
- 5:48SCHED_RR (Round Robin)
- 7:57Priorities Nuke Washing Machine
- 9:17Rate Monotonic Scheduling (RMS)
- 15:31Implementing SCHED_DEADLINE
- 18:42sched yield()
- 24:02Donut Hole Puncheri
- 24:47Deadline vs Period
- 26:28Multi processors! (Dhall's Effect)
- 32:47The limits of SCHED DEADLINE
- 36:22Giving SCHED DEADLINE Affinity
- 38:19Calculating WCET
- 38:35GRUB (not the bootloader)
- 40:58Questions?
related talks
50mSCHED_DEADLINE: It's Alive!
23mSCHED_DEADLINE desiderata and slightly crazy ideas
46mOptimizing Scheduler for Linux Gaming
22mWelcome message and DL Server
25mLinux needs a Scheduler QOS API -- and it isn't nice(2)
19mDelay accounting: an underrated feature of the Linux kernel
32mCPU Power Saving Methods for Real-time Workloads
40mLatency hints for CFS task