Lecture 9

Chapter 5: CPU Scheduling (cont)

Modified from 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
 Alternating Sequence of CPU and I/O Bursts

 Histogram of CPU-burst Times

CS 446 Principles of Computer Operating Systems 2

 Three-level Scheduling

SHORT-TERM

LONG-TERM MID-TERM

CS 446 Principles of Computer Operating Systems 3

 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

 Processes keep CPU until it releases either by terminating or I/O wait.

 All other scheduling is preemptive

 Interrupts

CS 446 Principles of Computer Operating Systems 4

 Two kinds of CPU-scheduling algorithms

 cooperative scheduling
 let a process run until it blocks on I/O, terminates or voluntarily releases the CPU
(system call)
Runnin
Ready
g

Blocke
d

 preemptive scheduling
 follow clock interrupts (ex: 50Hz) to forcibly switch processes (demote the “Running”
to “Ready”)
Runnin
Ready
g

Blocke
d

CS 446 Principles of Computer Operating Systems 5

 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

CS 446 Principles of Computer Operating Systems 6

 Scheduling Criteria
 CPU utilization – keep the CPU as busy as possible
 Typically between 40% to 90%
 Throughput – # of processes that complete their execution per time unit
 Depends on the length of process
 Turnaround time – amount of time to execute a particular process
 Sum of wait for memory, ready queue, execution, and I/O.
 Waiting time – amount of time a process has been waiting in the ready
queue
 Sum of wait in 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

CS 446 Principles of Computer Operating Systems 7

 Scheduling Algorithm Optimization Criteria

 Max CPU utilization

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

 In most cases, systems optimize average measure

 It is important to minimize variance

 Users prefer predictable response time to faster system with
high variances.

CS 446 Principles of Computer Operating Systems 8

 First-Come, First-Served (FCFS) Scheduling

 Nonpreemtive
 Convoy effect short process behind long process

A
Arrival times B
C
D
E

A B C D E Mean

CS 446 Principles of Computer Operating Systems 9

 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
 shortest-next-CPU-burst
 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

A
Arrival times B
C
D
E

Shortest Job
First (SJF)

A B C D E Mean
SJF

CS 446 Principles of Computer Operating Systems 10

 Determining Length of Next CPU Burst

 Can only estimate the length

 Can be done by using the length of previous CPU bursts

 using exponential averaging

1. t n  actual length of n th CPU burst

2.  n 1  predicted value for the next CPU burst
3.  , 0    1
4. Define :  n 1   t n  1    n .

CS 446 Principles of Computer Operating Systems 11

 Examples of Exponential Averaging
  =0
 n+1 = n
 Recent history does not count

  =1
 n+1 =  tn
 Only the actual last CPU burst counts

 If we expand the formula, we get:

n+1 =  tn+(1 - ) tn -1 + …
+(1 -  )j  tn -j + …
+(1 -  )n +1 0

 Since both  and (1 - ) are less than or equal to 1, each successive term
has less weight than its predecessor

CS 446 Principles of Computer Operating Systems 12

 Example of SJF (preemtive)
 choose the process whose remaining run time is shortest
 allows new short jobs to get good service

A
Arrival times B
C
D
E

A B C D E Mean

CS 446 Principles of Computer Operating Systems 13

 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 a priority scheduling where priority is the predicted next CPU burst
time

 Problem  Starvation
 low priority processes may never execute
 Solution  Aging
 as time progresses increase the priority of the process

CS 446 Principles of Computer Operating Systems 14

CS 446 Principles of Computer Operating Systems 15
 Round Robin (RR)

 Each process gets a small unit of CPU time (time quantum), 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.

 Performance
 q large  FIFO
 q small  q must be large with respect to context switch, otherwise
overhead is too high

CS 446 Principles of Computer Operating Systems 16

 Examples of RR
A
Arrival times B
C
D
E

A B C D E Mean

A B C D E Mean

CS 446 Principles of Computer Operating Systems 17

 Time Quantum and Context Switch Time

CS 446 Principles of Computer Operating Systems 18

 Turnaround Time Varies With The Time Quantum

CS 446 Principles of Computer Operating Systems 19

 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;
 e.g., 80% to foreground in RR; 20% to background in FCFS

CS 446 Principles of Computer Operating Systems 20

 Multilevel Queue Scheduling

CS 446 Principles of Computer Operating Systems 21

 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

CS 446 Principles of Computer Operating Systems 22

 Example of Multilevel Feedback Queue
 Three queues:
 Q0 – RR with time quantum 8 ms
 Q1 – RR time quantum 16 ms
 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 does not complete, it is preempted and moved to queue Q2.

CS 446 Principles of Computer Operating Systems 23

 Thread Scheduling
 Distinction between user-level and kernel-level threads

 Many-to-one and many-to-many models, thread library schedules

user-level threads to run on LWP
 Known as process-contention scope (PCS)
 scheduling competition is within the process

 Kernel thread scheduled onto available CPU is system-contention

scope (SCS)
 competition among all threads in system

 Pthread Scheduling
 API allows specifying either PCS or SCS during thread creation

CS 446 Principles of Computer Operating Systems 24

 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,
 alleviates 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

CS 446 Principles of Computer Operating Systems 25

 Multiple-Processor Scheduling
Processor affinity
 process has affinity for processor on which it is currently running
 soft affinity
 hard affinity

Non-uniform memory access

Load balancing
 Push migration
 Pull migration

CS 446 Principles of Computer Operating Systems 26

 Multicore Processors
 Recent trend to place multiple processor cores on same physical chip
 Faster and consume less power

 Multiple threads per core also growing

 Takes advantage of memory stall to make progress on another thread
while memory retrieve happens

CS 446 Principles of Computer Operating Systems 27

 Operating System Examples

 Solaris scheduling
 Windows XP scheduling
 Linux scheduling

CS 446 Principles of Computer Operating Systems 28

 Solaris Scheduling

Dispatch Table

Multilevel feedback queue

CS 446 Principles of Computer Operating Systems 29

 Windows XP Priorities
 Priority based
 preemptive

CS 446 Principles of Computer Operating Systems 30

 Linux Scheduling
 Constant order O(1) scheduling time
 Priority based
 Preemptive

CS 446 Principles of Computer Operating Systems 31

 Algorithm Evaluation
 Analytical modeling
 Several projections become possible by just formulas
 Deterministic modeling
 takes a particular predetermined workload and defines the
performance of each algorithm for that workload
 FCFS

 Average wait = 28

 SJF

 Average wait = 13

 RR

 Average wait = 23
CS 446 Principles of Computer Operating Systems 32
 Algorithm Evaluation
 Queuing models
 Distribution of CPU and I/O bursts
 Distribution of arrival times
 Little’s formula: n =  x W
 In steady-state, number of departures must be equal to the number
of arrivals

CS 446 Principles of Computer Operating Systems 33

 Algorithm Evaluation
 Simulation

CS 446 Principles of Computer Operating Systems 34

 Scheduling algorithm goals

CS 446 Principles of Computer Operating Systems 35

End of Chapter 5

Modified from Silberschatz, Galvin and Gagne ©2009