Lecture 6 on "Introduction to CPU Scheduling" delves into the shift from low-level process management to the exploration of high-level operating system scheduling policies. It starts with foundational assumptions about job processes to establish a basic understanding of scheduling disciplines, despite their somewhat unrealistic nature. The lecture introduces key scheduling metrics, with a focus on turnaround time, and discusses various scheduling strategies, including First In First Out (FIFO), Shortest Job First (SJF), and its preemptive variant, Shortest Time-to-Completion First (STCF). It also addresses the importance of response time in time-shared systems, leading to the exploration of Round Robin (RR) scheduling for optimizing interactive performance. The discussion extends to incorporating I/O operations into scheduling and the challenges posed by the unpredictability of job lengths. The lecture sets the stage for advanced scheduling solutions like multi-level feedback queue scheduling, which uses historical data to predict future job behavior, aiming to balance efficiency and fairness in system resource allocation.
This is an excellent video. It is so good that we are featuring it again as a review (originally posted in Lecture 3). Definitely watch this if you haven’t already. It will give you a solid foundation to work from as we investigate CPU scheduling to support multi-processing.
FA 2024 Slides:
https://docs.google.com/presentation/d/1q2gZsqj-5km-MN7lzNyx3lgax95lkbTZ2HCyrLWoXms/edit?usp=sharing
Original slides:
https://docs.google.com/presentation/d/1ydSPyKlTjyCI13_HsAUjutvNHw5_YNX9NjFl-SWSVHI/edit?usp=sharing
No example code for this lecture.
No additional references or resources at this time.