Chapter 4: CPU Scheduling

Operating System Concepts – 8th Edition! Silberschatz, Galvin and Gagne ©2009!
 Chapter 4: CPU Scheduling
 Basic Concepts"
 Scheduling Criteria "
 Scheduling Algorithms"
 Operating Systems Examples"

Operating System Concepts – 8th Edition! 4.2! Silberschatz, Galvin and Gagne ©2009!
 Basic Concepts
 Maximum CPU utilization obtained with multiprogramming"

 CPU–I/O Burst Cycle – Process execution consists of a cycle of CPU

execution and I/O wait"

 CPU burst distribution"

Operating System Concepts – 8th Edition! 4.3! Silberschatz, Galvin and Gagne ©2009!
 Alternating Sequence of CPU and
I/O Bursts

Operating System Concepts – 8th Edition! 4.4! Silberschatz, Galvin and Gagne ©2009!
 Histogram of CPU-burst Times

Operating System Concepts – 8th Edition! 4.5! Silberschatz, Galvin and Gagne ©2009!
 CPU Scheduler
 Selects from among the processes in ready queue, and allocates the CPU to
one of them"
 Queue may be ordered in various ways"
 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!
 Consider access to shared data"
 Consider preemption while in kernel mode"
 Consider interrupts occurring during crucial OS activities"

Operating System Concepts – 8th Edition! 4.6! Silberschatz, Galvin and Gagne ©2009!
 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"
 jumping to 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"

Operating System Concepts – 8th Edition! 4.7! Silberschatz, Galvin and Gagne ©2009!
 Scheduling Criteria
 CPU utilization – keep the CPU as busy as possible"

 Throughput – # of 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)"

Operating System Concepts – 8th Edition! 4.8! Silberschatz, Galvin and Gagne ©2009!
 Scheduling Algorithm Optimization Criteria

 Max CPU utilization"

 Max throughput"
 Min turnaround time "
 Min waiting time "
 Min response time"

Operating System Concepts – 8th Edition! 4.9! Silberschatz, Galvin and Gagne ©2009!
 First-Come, First-Served (FCFS) Scheduling

" "Process
"Burst Time""
" " P1 "24"
" " P2 "3"
" " P3 !3!

 Suppose that the processes arrive in the order: P1 , P2 , P3

The Gantt Chart for the schedule is:
P1" P2" P3"

0" 24" 27" 30"

"
"
 Waiting time for P1 = 0; P2 = 24; P3 = 27"
 Average waiting time: (0 + 24 + 27)/3 = 17"

Operating System Concepts – 8th Edition! 4.10! Silberschatz, Galvin and Gagne ©2009!
 FCFS Scheduling (Cont.)
Suppose that the processes arrive in the order:"
" " P2 , P3 , P1 "
 The Gantt chart for the schedule is:
"
P2" P3" P1"

0" 3" 6" 30"

 Waiting time for P1 = 6; P2 = 0; P3 = 3!

 Average waiting time: (6 + 0 + 3)/3 = 3"
 Much better than previous case"
 Convoy effect - short process behind long process"
 Consider one CPU-bound and many I/O-bound processes"
Operating System Concepts – 8th Edition! 4.11! Silberschatz, Galvin and Gagne ©2009!
 Shortest-Job-First (SJF) Scheduling
 Associate with each process the length of its next CPU burst"
 Use these lengths to schedule the process with the shortest time"

 SJF is optimal – gives minimum average waiting time for a given set of
processes"
 The difficulty is knowing the length of the next CPU request"
 Could ask the user"

Operating System Concepts – 8th Edition! 4.12! Silberschatz, Galvin and Gagne ©2009!
 Example of SJF
" " ProcessArriva"l Time "Burst Time"
" " P1 "0.0 "6"
" " P2 !2.0 "8"
" " P3 "4.0 "7"
" " P4 "5.0 "3"
 SJF
P4scheduling
" chart"
P" P3" P2"
1

0" 3" 9" 16" 24"

 Average waiting time = (3 + 16 + 9 + 0) / 4 = 7!

Operating System Concepts – 8th Edition! 4.13! Silberschatz, Galvin and Gagne ©2009!
 Example of Shortest-remaining-time-first

 Now we add the concepts of varying arrival times and preemption to the analysis"
"
" " ProcessA"arri Arrival TimeT "Burst Time"
" " P1 "0 "8"
" " P2 !1 "4"
" " P3 "2 "9"
" " P4 "3 "5"
 P1" P4" Chart"
P2" SJF Gantt
Preemptive P1" P3"

0" 1" 5" 10" 17" 26"

 Average waiting time = [(10-1)+(1-1)+(17-2)+5-3)]/4 = 26/4 = 6.5 msec"

Operating System Concepts – 8th Edition! 4.14! Silberschatz, Galvin and Gagne ©2009!
!
 Priority Scheduling
 A priority number (integer) is associated with each process"

 The CPU is allocated to the process with the highest priority (smallest integer
≡ highest priority)"
 Preemptive"
 Nonpreemptive"

 SJF is priority scheduling where priority is the inverse of predicted next CPU
burst time"

 Problem ≡ Starvation – low priority processes may never execute"

 Solution ≡ Aging – as time progresses increase the priority of the process"

"

Operating System Concepts – 8th Edition! 4.15! Silberschatz, Galvin and Gagne ©2009!
 Example of Priority Scheduling

" " ProcessA "arri Burst TimeT "Priority"

" " P1 "10 "3"
" " P2 !1 "1"
" " P3 "2 "4"
" " P4 "1 "5"
" "P5 !5 "2"
P5"
P2" scheduling
 Priority P 1"
Gantt Chart" P 3" P4"

0" 1" 6" 16" 18" 19"

 Average waiting time = 8.2 msec!

Operating System Concepts – 8th Edition! 4.16! Silberschatz, Galvin and Gagne ©2009!
 Round Robin (RR)

 Each process gets a small unit of CPU time (time quantum q), usually
10-100 milliseconds. After this time has elapsed, the process is preempted
and added to the end of the ready queue."
 If there are n processes in the ready queue and the time quantum is q, then
each process gets 1/n of the CPU time in chunks of at most q time units at
once. No process waits more than (n-1)q time units."
 Timer interrupts every quantum to schedule next process"
 Performance"
 q large ⇒ FIFO"
 q small ⇒ q must be large with respect to context switch, otherwise
overhead is too high"

Operating System Concepts – 8th Edition! 4.17! Silberschatz, Galvin and Gagne ©2009!
 Example of RR with Time Quantum = 4

" "Process "Burst Time"

! !P1 !24"

" " P2 ! 3"

" " P3 !3"

" ""
 The Gantt chart is:
P1" P2" P3" P1" P1" P1" P1" P1"

0" 4" 7" 10" 14" 18" 22" 26" 30"

"
 Typically, higher average turnaround than SJF, but better response!
 q should be large compared to context switch time"
 q usually 10ms to 100ms, context switch < 10 usec"

Operating System Concepts – 8th Edition! 4.18! Silberschatz, Galvin and Gagne ©2009!
 Time Quantum and Context Switch Time

Operating System Concepts – 8th Edition! 4.19! Silberschatz, Galvin and Gagne ©2009!
 Multilevel Queue
 Ready queue is partitioned into separate queues, eg:"
 foreground (interactive)"
 background (batch)"
 Process permanently in a given queue"

 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 "

Operating System Concepts – 8th Edition! 4.20! Silberschatz, Galvin and Gagne ©2009!
 Multilevel Queue Scheduling

Operating System Concepts – 8th Edition! 4.21! Silberschatz, Galvin and Gagne ©2009!
 Multilevel Feedback Queue

 A process can move between the various queues; aging can be

implemented this way"

 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 demote a process"
 method used to determine which queue a process will enter when
that process needs service"

Operating System Concepts – 8th Edition! 4.22! Silberschatz, Galvin and Gagne ©2009!
 Example of Multilevel Feedback Queue
 Three queues: "
 Q0 – RR with time quantum 8 milliseconds"
 Q1 – RR time quantum 16 milliseconds"
 Q2 – FCFS"

 Scheduling"
 A new job enters queue Q0 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 Q1"
 At Q1 job is again served FCFS and receives 16 additional milliseconds"
 If it still does not complete, it is preempted and moved to queue Q2"

Operating System Concepts – 8th Edition! 4.23! Silberschatz, Galvin and Gagne ©2009!
 Multilevel Feedback Queues

Operating System Concepts – 8th Edition! 4.24! Silberschatz, Galvin and Gagne ©2009!
 Multiple-Processor Scheduling

 CPU scheduling more complex when multiple CPUs are available"

 Homogeneous processors within a multiprocessor"

 Asymmetric multiprocessing – only one processor accesses the system

data structures, alleviating the need for data sharing"

 Symmetric multiprocessing (SMP) – each processor is self-scheduling,

all processes in common ready queue, or each has its own private queue of
ready processes"
 Currently, most common"

 Processor affinity – process has affinity for processor on which it is

currently running"
 soft affinity!
 hard affinity!
 Variations including processor sets!
Operating System Concepts – 8th Edition! 4.25! Silberschatz, Galvin and Gagne ©2009!
 NUMA and CPU Scheduling

Note that memory-placement algorithms

can also consider affinity

Operating System Concepts – 8th Edition! 4.26! Silberschatz, Galvin and Gagne ©2009!
 Windows Scheduling
 Windows uses priority-based preemptive scheduling"
 Highest-priority thread runs next"
 Dispatcher is scheduler"
 Thread runs until (1) blocks, (2) uses time slice, (3) preempted by higher-priority
thread"
 Real-time threads can preempt non-real-time"
 32-level priority scheme"
 Variable class is 1-15, real-time class is 16-31"
 Priority 0 is memory-management thread"
 Queue for each priority"
 If no run-able thread, runs idle thread!

Operating System Concepts – 8th Edition! 4.27! Silberschatz, Galvin and Gagne ©2009!
 Windows Priority Classes
 Win32 API identifies several priority classes to which a process can belong"
 REALTIME_PRIORITY_CLASS, HIGH_PRIORITY_CLASS,
ABOVE_NORMAL_PRIORITY_CLASS,NORMAL_PRIORITY_CLASS,
BELOW_NORMAL_PRIORITY_CLASS, IDLE_PRIORITY_CLASS!
 All are variable except REALTIME"
 A thread within a given priority class has a relative priority"
 TIME_CRITICAL, HIGHEST, ABOVE_NORMAL, NORMAL,
BELOW_NORMAL, LOWEST, IDLE"
 Priority class and relative priority combine to give numeric priority"
 Base priority is NORMAL within the class"
 If quantum expires, priority lowered, but never below base"
 If wait occurs, priority boosted depending on what was waited for"
 Foreground window given 3x priority boost"

Operating System Concepts – 8th Edition! 4.28! Silberschatz, Galvin and Gagne ©2009!
 Windows XP Priorities

Operating System Concepts – 8th Edition! 4.29! Silberschatz, Galvin and Gagne ©2009!
 Linux Scheduling

 Constant order O(1) scheduling time"

 Preemptive, priority based"
 Two priority ranges: time-sharing and real-time"
 Real-time range from 0 to 99 and nice value from 100 to 140"
 Map into global priority with numerically lower values indicating higher
priority"
 Higher priority gets larger q"
 Task run-able as long as time left in time slice (active)"
 If no time left (expired), not run-able until all other tasks use their slices"
 All run-able tasks tracked in per-CPU runqueue data structure"
 Two priority arrays (active, expired)"
 Tasks indexed by priority"
 When no more active, arrays are exchanged"
"

Operating System Concepts – 8th Edition! 4.30! Silberschatz, Galvin and Gagne ©2009!
 Priorities and Time-slice length

Operating System Concepts – 8th Edition! 4.31! Silberschatz, Galvin and Gagne ©2009!