CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling
Basic Concepts An OS must allocate resources amongst competing processes The resource is allocated by means of a schedule The aim of processor scheduling is to assign processes to be executed by the processor over time The scheduling function should Share time fairly among processes Prevent starvation of a process Use the processor efficiently Prioritise processes when necessary
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 is nonpreemptive. All other scheduling is preemptive
Nonpreemptive and Preemptive Non-preemptive Once a process is in the running state, it will continue until it terminates or blocks itself for I/O Preemptive Currently running process may be interrupted and moved to ready state by the OS Preemption may occur when new process arrives, on an interrupt, or periodically.
Scheduling Criteria CPU utilization keep the CPU as busy as possible Throughput processes that complete their execution per time unit Turnaround time amount of time to execute a particular process Waiting time amount of time a process has been waiting in the ready queue Response time amount of time it takes from when a request was submitted until the first response is produced, not output (for time-sharing environment)
1. Long-Term Scheduling: Types of 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 2. Medium-Term Scheduling: Part of the swapping function Swapping-in decisions are based on the need to manage the degree of multiprogramming
Types of Scheduling 3. Short-Term Scheduling: Known as the dispatcher Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; this involves: switching context switching to user mode detecting the proper location in the user program to restart that program Dispatch latency time it takes for the dispatcher to stop one process and start another running. Invoked when an event occurs Clock interrupts I/O interrupts Operating system calls Signals
Scheduling and Process State Transitions
Nesting of Scheduling Functions
Priorities Scheduler will always choose a process of higher priority over one of lower priority Have multiple ready queues to represent each level of priority Priority Queuing
Starvation Problem: Lower-priority may suffer starvation if there is a steady supply of high priority processes. Solution: Allow a process to change its priority based on its age or execution history
Scheduling Algorithms First Come, First Served (FCFS) Shortest Job First (SJF) Non-preemptive, Preemptive Priority Scheduling - Non-preemptive, Preemptive Round Robin Scheduling
Multilevel Queue Ready queue is partitioned into separate queues: foreground (interactive) background (batch) Each queue has its own scheduling algorithm, foreground RR background FCFS Scheduling must be done between the queues. Fixed priority scheduling; (i.e., serve all from foreground then from background). Possibility of starvation. Time slice each queue gets a certain amount of CPU time which it can schedule amongst its processes; i.e., 80% to foreground in RR 20% to background in FCFS
Multilevel Queue Scheduling
Multilevel Feedback Queue A process can move between the various queues Multilevel-feedback-queue scheduler defined by the following parameters: number of queues scheduling algorithms for each queue method used to determine when to upgrade a process method used to determine when to downgrade a process method used to determine which queue a process will enter when that process needs service
Example of Multilevel Feedback Queue Three queues: Q 0 time quantum 8 milliseconds Q 1 time quantum 16 milliseconds Q 2 FCFS Scheduling A new job enters queue Q 0 which is served FCFS. When it gains CPU, job receives 8 milliseconds. If it does not finish in 8 milliseconds, job is moved to queue Q 1. At Q 1 job is again served FCFS and receives 16 additional milliseconds. If it still does not complete, it is preempted and moved to queue Q 2.