Chapter 5: Process
Scheduling
Operating System Concepts – 8th Edition, Silberschatz, Galvin and Gagne ©2009
Chapter 5: Process Scheduling
Basic Concepts
Scheduling Criteria
Scheduling Algorithms
Thread Scheduling
Multiple-Processor Scheduling
Operating Systems Examples
Algorithm Evaluation
Operating System Concepts – 8th Edition 5.2 Silberschatz, Galvin and Gagne ©2009
Objectives
To introduce process scheduling, which is the basis for multiprogrammed
operating systems
To describe various process-scheduling algorithms
To discuss evaluation criteria for selecting a process-scheduling algorithm
for a particular system
Operating System Concepts – 8th Edition 5.3 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 5.4 Silberschatz, Galvin and Gagne ©2009
Alternating Sequence of CPU And I/O Bursts
Operating System Concepts – 8th Edition 5.5 Silberschatz, Galvin and Gagne ©2009
Histogram of CPU-burst Times
Operating System Concepts – 8th Edition 5.6 Silberschatz, Galvin and Gagne ©2009
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
Operating System Concepts – 8th Edition 5.7 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 5.8 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 5.9 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 5.10 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 5.11 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
Operating System Concepts – 8th Edition 5.12 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
Two schemes:
Non-preemptive – once a process is given processor
usage, the process is not interrupted until the burst is over.
Preemptive – if a new process comes up with a shorter
duration than the remaining time of the current process,
interrupt the current process. This scheme is also known
as Shortest-Remaining-Time-First (SRTF).
Operating System Concepts – 8th Edition 5.13 Silberschatz, Galvin and Gagne ©2009
Example of SJF (Non-Preemptive SJF)
Process Arrival Time Burst Time
P1 0.0 6
P2 2.0 8
P3 4.0 7
P4 0.0 3
SJF scheduling chart
P4 P1 P3 P2
0 3 9 16 24
Average waiting time = (3 + 14 + 5 + 0) / 4 = 5.5
Operating System Concepts – 8th Edition 5.14 Silberschatz, Galvin and Gagne ©2009
Preemptive SJF Example
Process Arrival Time Burst Time
P1 0.0 7
P2 2.0 4
P3 4.0 1
P4 5.0 4
SJF (Preemptive)
P1 P2 P3 P2 P4 P1
0 2 4 5 7 11 16
Average Waiting Time= (9 + 1 + 0 +2)/4 = 3
Operating System Concepts – 8th Edition 5.15 Silberschatz, Galvin and Gagne ©2009
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 .
Operating System Concepts – 8th Edition 5.16 Silberschatz, Galvin and Gagne ©2009
Prediction of the Length of the Next CPU Burst
Operating System Concepts – 8th Edition 5.17 Silberschatz, Galvin and Gagne ©2009
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
Operating System Concepts – 8th Edition 5.18 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 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
Operating System Concepts – 8th Edition 5.19 Silberschatz, Galvin and Gagne ©2009
Priority Scheduling Example (Non-
Preemptive)
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 4
P4 1 5
P5 5 2
Priority Scheduling
P2 P5 P1 P3 P4
0 1 6 16 18 19
Average Waiting Time= (0 + 1 + 6 + 16 + 18)/5 = 8.2
Operating System Concepts – 8th Edition 5.20 Silberschatz, Galvin and Gagne ©2009
Priority Scheduling Example (Preemptive)
Process Arrival Time Burst Time Priority
P1 0.0 7 2
P2 2.0 4 1
P3 4.0 1 3
P4 5.0 4 2
SJF (Preemptive)
P1 P2 P2 P2 P1 P4 P3
0 2 4 5 6 11 15 16
Average Waiting Time= (4 + 0 + 11 +6)/4 = 5,25
Operating System Concepts – 8th Edition 5.21 Silberschatz, Galvin and Gagne ©2009
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
Operating System Concepts – 8th Edition 5.22 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
Operating System Concepts – 8th Edition 5.23 Silberschatz, Galvin and Gagne ©2009
Time Quantum and Context Switch Time
Operating System Concepts – 8th Edition 5.24 Silberschatz, Galvin and Gagne ©2009
Turnaround Time Varies With The Time Quantum
Operating System Concepts – 8th Edition 5.25 Silberschatz, Galvin and Gagne ©2009
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
Operating System Concepts – 8th Edition 5.26 Silberschatz, Galvin and Gagne ©2009
Multilevel Queue Scheduling
Operating System Concepts – 8th Edition 5.27 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 5.28 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 5.29 Silberschatz, Galvin and Gagne ©2009
Multilevel Feedback Queues
Operating System Concepts – 8th Edition 5.30 Silberschatz, Galvin and Gagne ©2009
End of Chapter 5
Operating System Concepts – 8th Edition, Silberschatz, Galvin and Gagne ©2009