Save this video free

ECE344 Fall 2026 (Sec 1) Lec 21 - Advanced Scheduling

Jon Eyolfson · 56:55 · Watch on YouTube

Part of University of Toronto ECE 344. See all 22 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

Jon Eyolfson explains how advanced CPU scheduling balances fairness, responsiveness, throughput, and processor efficiency, moving from priority and feedback scheduling to multicore strategies and Linux’s policies. He details priority inversion and inheritance, processor affinity and work stealing, then traces Linux’s fair scheduling from virtual runtime and red-black trees to EEVDF, introduced in Linux 6.6.

Key takeaways

Chapters

0:00 Basic Scheduling Tradeoffs Set Up Advanced Scheduling
7:52 Priority Scheduling and Dynamic Feedback
17:31 Priority Inversion and POSIX Priority Inheritance
21:44 Foreground Queues Favor Responsiveness, Background Queues Favor Throughput
24:05 Global and Per-CPU Scheduling on SMP Systems
29:30 Work Stealing, Processor Affinity, and Gang Scheduling
33:32 Linux Real-Time Policies and Priority Controls
42:15 Linux Priority Values and Scheduler Evolution
47:19 CFS Virtual Runtime Models Fair CPU Sharing
52:12 EEVDF Adds Virtual Deadlines to Fair Scheduling
54:24 Scheduling Tradeoffs Extend Beyond CPU Cores

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

2:02 Mhm. >> Mhm.

4:37 >> Alrighty, welcome back to operating system. So, hopefully your midterm hell is over ish. No? That sucks. Well, thankfully we have fairly chill lectures now. So, we even skipped advanced scheduling so that on test two, which hopefully wasn't too bad, uh Worse than test one? It was shorter at least. I counted the number of words. It was like 70%. The answer Okay. Uh okay. I guess I have to redo my

5:41 timing cuz I did like 15 minutes. >> [laughter] >> Yikes. Yeah. Maybe I have to multiply by four instead of three. All right. Well, anyways, well, you'll be good to know that also question five on that was worded poorly enough that uh I accepted A and B. That was the multiple choice on like what happens with the new thread, blah blah blah. Yeah, it wasn't clear what was returning, so I accepted A and B. Basically, I graded that one like everyone got 100% on it. So, yay, free marks. So, hopefully that helps with the uh the subsequent questions. So, anyways, let's get into advanced scheduling. So, recall we talked about basic scheduling with a trade-off. So, we had

6:30 some algorithms, if you can generally call them that. First come, first serve is the simplest. Then there was shortest job first that had no preemptions, aka as soon as I started a process, it would not stop until it finished. So, to minimize the average waiting time, which was one of our things or one of our metrics, we could do shortest job first, always take the one that takes the least amount of time first. If we add preemptions, we could do shortest remaining time first. Again, that would cut the average waiting time, but we would have some

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Jon Eyolfson.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.