Chapter 5 CPU Scheduling_8266_2079_20110317120209.ppt

Chapter 5 CPU Scheduling LIU Duo bat@mail.tsinghua.edu.cn * 大纲规定的课程教学内容 了解处理器调度的准则、了解高级调度、中级调度、低级调度的概念与区别 了解实时调度与多处理机调度概念，掌握各种调度算法，理解调度的算法评估模型，了解进程调度与作业调度的区别 了解基于Unix或Linux或Solaris或Windows 2000/XP环境下调度算法 ?5.1 Basic Concepts Scheduling Long-Term Scheduling Determines which programs are admitted to the system for processing Controls the degree of multiprogramming Medium-Term Scheduling Part of the swapping function Based on the need to manage the degree of multiprogramming Short-Term Scheduling Known as the dispatcher Executes most frequently CPU Scheduling Earlier, we talked about the life-cycle of a process Active processes work their way from Ready queue to Running to various waiting queues. Question: How is the OS to decide which of several tasks to take off a queue? Obvious queue to worry about is ready queue Others can be scheduled as well, however Diagram of Process State CPU Scheduler Selects from among the processes in memory that are ready to execute, and allocates the CPU to one of them CPU scheduling decisions may take place when a process: 1. Switches from running to waiting state 2. Switches from running to ready state 3. Switches from waiting to ready 4. Terminates Scheduling under 1 and 4 (no choice in terms of scheduling) is nonpreemptive All other scheduling is preemptive Dispatcher Dispatcher module gives control of the CPU to the process selected by the short-term scheduler Dispatch latency – time it takes for the dispatcher to stop one process and start another running Scheduling Assumptions CPU scheduling is a big area of research in early 70’s Many implicit assumptions for CPU scheduling: One program per user One thread per program Programs are independent Scheduling Assumptions Clearly, these are unrealistic but they simplify the problem so it can be solved For instance: is “fair” about fairness among users or programs? If I run one compilation job and you run five, you get five times as much CPU on many operating systems The hig