【英文原版】操作系统_精髓与设计原理_第6版 - Chapter09-new.pptVIP

Chapter 9Uniprocessor Scheduling Operating Systems:Internals and Design Principles, 6/EWilliam Stallings Dave Bremer Otago Polytechnic, N.Z.©2008, Prentice Hall Roadmap Types of Processor Scheduling Scheduling Algorithms Traditional UNIX Scheduling Scheduling An OS must allocate resources amongst competing processes. The resource provided by a processor is execution time The resource is allocated by means of a schedule Overall Aim of Scheduling The aim of processor scheduling is to assign processes to be executed by the processor over time, in a way that meets system objectives, such as response time, throughput, and processor efficiency. Scheduling Objectives The scheduling function should Share time fairly among processes Prevent starvation of a process Use the processor efficiently Have low overhead Prioritise processes when necessary (e.g. real time deadlines) Types of Scheduling Two Suspend States Remember this diagram from Chapter 3 Scheduling and Process State Transitions Nesting of Scheduling Functions Queuing Diagram Long-Term Scheduling Determines which programs are admitted to the system for processing May be first-come-first-served Or according to criteria such as priority, I/O requirements or expected execution time Controls the degree of multiprogramming More processes, smaller percentage of time each process is executed Medium-Term Scheduling Part of the swapping function Swapping-in decisions are based on the need to manage the degree of multiprogramming Short-Term Scheduling Known as the dispatcher Executes most frequently Invoked when an event occurs Clock interrupts I/O interrupts Operating system calls Signals Roadmap Types of Processor Scheduling Scheduling Algorithms Traditional UNIX Scheduling Aim of Short Term Scheduling Main objective is to allocate processor time to optimize certain aspects of system behaviour. A set of criteria is needed to evaluate the scheduling policy. Short-Term Scheduling Criteria: User vs System We can di