CPU Scheduling Algorithms - Operating Systems

Описание

In this video, we discuss "CPU Scheduling Algorithms" used in Operating Systems. We start with definition of basic concepts of scheduling to set the context and discuss various criteria for CPU scheduling. We compare and discuss the most popular CPU scheduling algorithms namely, First-come First-served (FCFS), Shortest Job Next (SJF), Round Robin (RR), Priority, Multi-level queue and Multi-level feedback queue. We discuss features of each algorithm with a short example. Finally, we as always, we end with a set of review questions for the viewer (reader).
00:00 - Start
06:32 - Introduction & Basic Concepts (CPU/IO Bursts, Scheduler, Dispatcher)
15:34 - Scheduling Criteria
19:29 - Comparison of Popular Algorithms
25:39 - First-come First-served (FCFS) Scheduling
30:21 - Shortest Job Next (SJF) Scheduling
34:31 - Round Robin (RR) Scheduling
40:56 - Priority Scheduling
44:50 - Multi-level queue Scheduling
49:00 - Multi-level feedback queue Scheduling
54:40 - Review Questions

Reference Book: Abraham Silberschatz, Greg Gagne, and Peter Baer Galvin, "Operating System Concepts, Ninth Edition ", Chapter 5