操作系统Chapter2-Scheduling.pptVIP

Modern Operating Systems Chapter 2 – Scheduling;Content of this lecture;What is Scheduling?;A Seven-State Process Model (1);A Seven-State Process Model (2);A Seven-State Process Model (3);Classification of Scheduling Activity;Queuing Diagram for Scheduling;Long-Term Scheduling;Medium-Term Scheduling;Short-Term Scheduling;Process Behavior (1);Process Behavior (2);Process Behavior (3);Process Behavior (4);CPU Scheduling;When to Schedule?;Preemptive vs. Non-preemptive;Categories of Scheduling Algorithms;Scheduling Algorithm Goals (1);Scheduling Algorithm Goals(2);Single Processor Scheduling Algorithms;First-Come First-Served (FCFS);FCFS Example (1);Suppose that the processes arrive in the order P2 , P3 , P1 The Gantt chart for the schedule is: Waiting time for P1 = 7; P2 = 0; P3 = 3 Average waiting time: (7 + 0 + 3)/3 = 3.3 Much better than previous case. Convoy effect short process behind long process;FCFS Discussion;Convoy Effects (1);Convoy Effects (2);Convoy Effects (3);Shortest Job First (SJF);Non-preemptive SJF: Example;Comparing to FCFS;SJF is not always optimal;What if the scheduler waits for 2 time units? (Do it yourself);SJF Discussion;Starvation;Preemptive SJF;Preemptive SJF: Same Example;Scheduling in Batch Systems ;Interactive Scheduling Algorithms;Round-robin Scheduling(1);Round-robin Scheduling (2);Round-robin Scheduling (3);Round-robin: Example;Time Quantum (1);Time Quantum (2);;Time Quantum (4);Round-robin Discussion (1);Round-robin Discussion (2);Priority Scheduling (1);Priority Scheduling (2);Priority Scheduling (3);Priority in Unix (1);Priority in Unix (2);Priority in Unix (3);Priority Scheduling: Example;Non-preemptive SJF: Example;Priority Scheduling Discussion;Multi-Level Queue (1) ;Multi-Level Queue (2) ;Multi-Level Queue (3) ;Multi-Level Queue (4) ;Multi-Level Queue (5);Multi-Level Feedback Queue;Three queues: Q0 – time quantum 8 milliseconds Q1 – time quantum 16 milliseconds Q2 – FCFS Scheduling A new job enters queue Q0 which is se