OSC-5 CU scheduling.pptVIP

OPERATING SYSTEM CONCEPTS 张 柏 礼 bailey_zhang@ 东南大学计算机学院 5. CPU Scheduling Objectives To introduce CPU scheduling, which is the basis for multi-programmed operating systems To describe various CPU-scheduling algorithms To discuss evaluation criteria（准则） for selecting a CPU-scheduling algorithm for a particular system 5. CPU Scheduling 5.1 Basic Concepts 5.2 Scheduling Criteria 5.3 Scheduling Algorithms 5.4 Multiple-Processor Scheduling 5.5 Thread Scheduling 5.6 Operating Systems Examples 5.7 Algorithm Evaluation 5.1 Basic Concepts The objective of multi-programming is to have some process running at all times, to maximize CPU utilization Several processes are kept in memory at one time When a running process has to wait, the OS takes the CPU away from that process and gives the CPU to another process Scheduling of this kind is fundamental OS function CPU Scheduling is central to operating-system design 5.1 Basic Concepts CPU–I/O Burst Cycle Process execution consists of a sequence of （1）CPU execution CPU burst （2）I/O wait. I/O burst Process alternate between these two states 5.1 Basic Concepts CPU burst distribution A larger number of short CPU burst and small number of long CPU burst This distribution is important to select the CPU-scheduling algorithm 5.1 Basic Concepts CPU Scheduler Short-term scheduler（or CPU scheduler ） Selects from among the processes in memory that are ready to execute, and allocates the CPU to one of them A ready queue can be implemented as A FIFO queue A priority queue A tree An unordered queue All the processes in the ready queue are lined up waiting for chance to run on the CPU 5.1 Basic Concepts Scheduling CPU scheduling decisions may take place when a process: （1）Switches from running to waiting state The result of an I/O request An invocation of wait for the termination of one of the child processes （2）Switches from running to ready state When a interrupt occurs （3）Switches from waiting to ready Completion of I/O （4）Terminates