Chapter 6: CPU Scheduling

Operating System Concepts – 9th Edition Silberschatz, Galvin and Gagne

 Chapter 6: CPU Scheduling
 Basic Concepts
 Scheduling Criteria
 Scheduling Algorithms

Operating System Concepts – 9th Edition 6.2 Silberschatz, Galvin and Gagne
 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 followed by I/O
burst
 CPU burst distribution is of
main concern

Operating System Concepts – 9th Edition 6.3 Silberschatz, Galvin and Gagne
 CPU Scheduler
 Short-term 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 – 9th Edition 6.4 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.5 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.6 Silberschatz, Galvin and Gagne
 Scheduling Algorithm Optimization Criteria

 Max CPU utilization

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

Operating System Concepts – 9th Edition 6.7 Silberschatz, Galvin and Gagne
 FCFS SCHEDULING

 In the "First come first serve" scheduling algorithm, as the

name suggests, the process which arrives first, gets
executed first, or we can say that the process which
requests the CPU first, gets the CPU allocated first.
 It's easy to understand and implement programmatically,
using a Queue data structure, where a new process enters
through the tail of the queue, and the scheduler selects
process from the head of the queue.
 A perfect real life example of FCFS scheduling is buying
tickets at ticket counter.
 Non preemptive
 Simple

Operating System Concepts – 9th Edition 6.8 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.9 Silberschatz, Galvin and Gagne
 proces Arrival Burst Completio Turnaround Waiting
s time time n time time=CT-AT time=(TAT- BT
)
P1 0 4 4 4 0

P2 1 3 7 6 3

p3 2 1 8 6 5

P4 3 2 10 7 5

p5 4 5 15 11 6

AVG AVG
TAT=34/5=6 WT=20/5=4
.8

P1 p2 p3 p4 p5
0 4 7 8 10 15

Operating System Concepts – 9th Edition 6.10 Silberschatz, Galvin and Gagne
 proces Arrival Burst Completio Turnaround Waiting
s time time n time time=CT-AT time=(TAT- BT
)
P1 0 4 4 4 0

P2 1 3 7 6 3

p3 2 1 8 6 5

P4 3 2 10 7 5

p5 4 5 15 11 6

AVG AVG
TAT=34/5=6 WT=19/5=3.8
.8

P1 P2 P3 P4 p5
0 4 7 8 10 15

Operating System Concepts – 9th Edition 6.11 Silberschatz, Galvin and Gagne
 P1 P2
0 2 5 15 20 25 30 35 40 45

Operating System Concepts – 9th Edition 6.12 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.13 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.14 Silberschatz, Galvin and Gagne
 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 scheduling chart

P4 P1 P3 P2
0 3 9 16 24

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

Operating System Concepts – 9th Edition 6.15 Silberschatz, Galvin and Gagne
  completion time=
 Turnaround time= completion time- arrival Time
 Waiting time = turnaround time- burst Time

Operating System Concepts – 9th Edition 6.16 Silberschatz, Galvin and Gagne
 proces Arrival Burst Completio Turnaround Waiting
s time time n time time=CT-AT time=(TAT- BT
)
P1 0 8 8 0

P2 1 4 11 7

p3 2 9 24 15

P4 3 5 14 9

Total 57/4 31/4

AVG AVG WT=7.75

TAT=14.25

P1 p2 P4 P3
0 8 12 17 26

Operating System Concepts – 9th Edition 6.17 Silberschatz, Galvin and Gagne
 SJF
Arrival
Process Id
time
Burst time CT TAT WT
P1 3 1

P2 1 4

P3 4 2

P4 0 6

P5 2 3

Operating System Concepts – 9th Edition 6.18 Silberschatz, Galvin and Gagne
 Example of Shortest-remaining-time-first

 Now we add the concepts of varying arrival times and

preemption to the analysis
ProcessAarri Arrival TimeTBurst Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
 Preemptive SJF Gantt Chart

P1 P2 P4 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 – 9th Edition 6.19 Silberschatz, Galvin and Gagne
 proces Arrival Burst Completio Turnaround Waiting
s time time n time time=CT-AT time=(TAT- BT
)
P1 0 8

P2 1 4

p3 2 9

P4 3 5

Total

AVG TAT= AVG WT=

Operating System Concepts – 9th Edition 6.20 Silberschatz, Galvin and Gagne
 proces Arrival Burst Completio Turnaround Waiting
s time time n time time=CT-AT time=(TAT- BT
)
P1 0 8 17 17 9

P2 1 4 5 4 0

p3 2 9 26 24 15

P4 3 5 10 7 2

Total 52 26

AVG AVG WT=6.5

TAT=13

P1 P2 P4 P1 P3
0 1 5 10 17 26

Operating System Concepts – 9th Edition 6.21 Silberschatz, Galvin and Gagne
 SRTF
PROCES At BT
S

P1 0 5

P2 1 3

P3 2 4

P4 4 1

Operating System Concepts – 9th Edition 6.22 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.23 Silberschatz, Galvin and Gagne
 10 6 2

Operating System Concepts – 9th Edition 6.24 Silberschatz, Galvin and Gagne
 Example of Priority Scheduling

ProcessAarri Burst TimeT Priority

P1 10 3
P2 1 1
P3 2 4
P4 1 5
P5 5 2

 Priority scheduling Gantt Chart

 Average waiting time = 8.2 msec

Operating System Concepts – 9th Edition 6.25 Silberschatz, Galvin and Gagne
 proces Burst Priorit Completio Turnaround Waiting
s time y n time time=CT-AT time=(TAT- BT
)
P1 10 3 16 16 6

P2 1 1 1 1 0

p3 2 4 18 18 16

P4 1 5 19 19 18

P5 5 2 6 6 1

AVG AVG WT=8.2

TAT=12
P2 P5 P1 P3 P4
0 1 6 16 18 19

Operating System Concepts – 9th Edition 6.26 Silberschatz, Galvin and Gagne
 proce Arriv Burst Priori Completi Turnaroun Waiting
ss al time ty on time d time=(TAT-
Time time=CT- BT )
AT
P1 0 4 2

P2 1 3 3

p3 2 1 4

P4 3 5 5

P5 4 2 5

hig AVG AVG WT=8.2

TAT=12

P2 P5 P1 P3 P4
0 1 6 16 18 19

Operating System Concepts – 9th Edition 6.27 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.28 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.29 Silberschatz, Galvin and Gagne
 Process ID Arrival Time
Q=4
Burst Time
MS
Completion
Time
Turn Around
Time
Waiting
Time

1 0 5 17 17 12

2 1 6 23 22 16

3 2 3 11 9 6

4 3 1 12 9 8

5 4 5 24 20 15

6 6 4 21 15 11

Ready queue
P1,P2 P3 P4 P5 P1 P6 P2 P5

P1 P2 P3 P4 P5 P1 P6 P2 P5
0 4 8 11 12 16 17 21 23 24

Operating System Concepts – 9th Edition 6.30 Silberschatz, Galvin and Gagne
Operating System Concepts – 9th Edition 6.31 Silberschatz, Galvin and Gagne
 Process ID Arrival Time Burst Time Completion Turn Around Waiting
Time Time Time

1 0 5 17 17 12

2 1 6 23 22 16

3 2 3 11 9 6

4 3 1 12 9 8

5 4 5 24 20 15

6 6 4 21 15 11

Operating System Concepts – 9th Edition 6.32 Silberschatz, Galvin and Gagne
 Process ID Arrival Time Burst Time Completion Turn Around Waiting
Time Time Time

1 0 5

2 1 3

3 2 1

4 3 2

5 4 3

Ready queue P1

P1

Operating System Concepts – 9th Edition 6.33 Silberschatz, Galvin and Gagne
 Q=2

ID Arrival Time Burst Time Completion Turn Around Waiting

Time Time Time

0 5

1 3

2 1

3 2

4 3

Ready queue P1

P1

Operating System Concepts – 9th Edition 6.34 Silberschatz, Galvin and Gagne
 Q=2

Process ID Arrival Time Burst Time Completion Turn Around Waiting

Time Time Time

1 0 4

2 1 5

3 2 2

4 3 1

5 4 6

6 6 3

Ready queue P1

P1

Operating System Concepts – 9th Edition 6.35 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.36 Silberschatz, Galvin and Gagne
 Multilevel Queue Scheduling

Operating System Concepts – 9th Edition 6.37 Silberschatz, Galvin and Gagne
 Multilevel Feedback Queue

 The idea is to separate processes according to the

characteristics of their CPU bursts. If a process uses too
much CPU time, it will be moved to a lower-priority queue.
 a process that waits too long in a lower-priority queue may
be moved to a higher-priority queue. This form of aging
prevents starvation
 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 – 9th Edition 6.38 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.39 Silberschatz, Galvin and Gagne
 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 – 9th Edition 6.40 Silberschatz, Galvin and Gagne
 NUMA and CPU Scheduling

Note that memory-placement algorithms can also consider affinity

Operating System Concepts – 9th Edition 6.41 Silberschatz, Galvin and Gagne
 Multiple-Processor Scheduling – Load Balancing

 If SMP, need to keep all CPUs loaded for efficiency

 Load balancing attempts to keep workload evenly
distributed
 Push migration – periodic task checks load on each
processor, and if found pushes task from
overloaded CPU to other CPUs
 Pull migration – idle processors pulls waiting task
from busy processor

Operating System Concepts – 9th Edition 6.42 Silberschatz, Galvin and Gagne
 Multicore Processors

 Recent trend to place multiple processor cores on

same physical chip
 Faster and consumes less power
 Multiple threads per core also growing
 Takes advantage of memory stall to make
progress on another thread while memory
retrieve happens

Operating System Concepts – 9th Edition 6.43 Silberschatz, Galvin and Gagne