Chapter 5: CPU Scheduling

Operating System Concepts with Java 8th Edition

5.1

Silberschatz, Galvin and Gagne 2009

Chapter 5: CPU Scheduling

Basic Concepts
Scheduling Criteria
Scheduling Algorithms
Thread Scheduling
Multiple-Processor Scheduling
Operating Systems Examples
Algorithm Evaluation

Operating System Concepts with Java 8th Edition

5.2

Silberschatz, Galvin and Gagne 2009

Objectives
To introduce CPU scheduling, which is the

basis for multiprogrammed operating systems

To describe various CPU-scheduling algorithms

To discuss evaluation criteria for selecting a

CPU-scheduling algorithm for a particular

system

Operating System Concepts with Java 8th Edition

5.3

Silberschatz, Galvin and Gagne 2009

Basic Concepts
Maximum CPU utilization obtained with

multiprogramming

CPUI/O Burst Cycle Process execution consists

of a cycle of CPU execution and I/O wait (I/O burst)

CPU burst distribution

An

I/O bound program typically has many short CPU

bursts.

CPU-bound program might have a few long CUP

bursts.

The

distribution is important in selecting CPU-scheduling

algorithm.

Operating System Concepts with Java 8th Edition

5.4

Silberschatz, Galvin and Gagne 2009

Histogram of CPU-burst Times

Operating System Concepts with Java 8th Edition

5.5

Silberschatz, Galvin and Gagne 2009

Alternating Sequence of CPU And I/O Bursts

Operating System Concepts with Java 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 (there is

no choice in terms of scheduling)

All other scheduling is preemptive

Operating System Concepts with Java 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 with Java 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 with Java 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 with Java 8th Edition

5.10

Silberschatz, Galvin and Gagne 2009

First-Come, First-Served (FCFS) Scheduling

Process

Burst Time

P1

24

P2

P3

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

The Gantt Chart for the schedule is:

P1

P2

24

P3
27

30

Waiting time for P1 = 0; P2 = 24; P3 = 27

Average waiting time: (0 + 24 + 27)/3 = 17

Operating System Concepts with Java 8th Edition

5.11

Silberschatz, Galvin and Gagne 2009

FCFS Scheduling (Cont)

Suppose that the processes arrive in ready queue in the order
P2 , P3 , P1
The Gantt chart for the schedule is:

P2
0

P3
3

P1
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 with Java 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

Operating System Concepts with Java 8th Edition

5.13

Silberschatz, Galvin and Gagne 2009

Example of SJF
Process

Arrival Time

Burst Time

P1

0.0

P2

2.0

P3

4.0

P4

5.0

SJF scheduling chart

P4
0

P3

P1
3

P2
16

24

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

Operating System Concepts with Java 8th Edition

5.14

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, most recent information

2. n 1 predicted value for the next CPU burst
3. n
4. , 0 1
5. Define :

n 1 t n 1 n
Most recent info

Operating System Concepts with Java 8th Edition

Stores Past history

5.15

Silberschatz, Galvin and Gagne 2009

Prediction of the Length of the Next CPU Burst

Operating System Concepts with Java 8th Edition

5.16

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 with Java 8th Edition

5.17

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 with Java 8th Edition

5.18

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

small q must be large with respect to context

switch, otherwise overhead is too high

Operating System Concepts with Java 8th Edition

5.19

Silberschatz, Galvin and Gagne 2009

Example of RR with Time Quantum = 4

Process

Burst Time

P1

24

P2

P3

The Gantt chart is:

P1
0

P2
4

P3
7

P1
10

P1
14

P1
18 22

P1
26

P1
30

Typically, higher average turnaround than SJF, but better response

Operating System Concepts with Java 8th Edition

5.20

Silberschatz, Galvin and Gagne 2009

Time Quantum and Context Switch Time

Operating System Concepts with Java 8th Edition

5.21

Silberschatz, Galvin and Gagne 2009

Turnaround Time Varies With The Time Quantum

Operating System Concepts with Java 8th Edition

5.22

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 with Java 8th Edition

5.23

Silberschatz, Galvin and Gagne 2009

Multilevel Queue Scheduling

Operating System Concepts with Java 8th Edition

5.24

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 with Java 8th Edition

5.25

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 with Java 8th Edition

5.26

Silberschatz, Galvin and Gagne 2009

Multilevel Feedback Queues

Operating System Concepts with Java 8th Edition

5.27

Silberschatz, Galvin and Gagne 2009

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) since

scheduling competition is within the process

Kernel thread scheduled onto available CPU is system-

contention scope (SCS) competition among all

threads in system

Operating System Concepts with Java 8th Edition

5.28

Silberschatz, Galvin and Gagne 2009

Pthread Scheduling
API allows specifying either PCS or SCS during

thread creation
PTHREAD

SCOPE PROCESS schedules

threads using PCS scheduling

PTHREAD

SCOPE SYSTEM schedules

threads using SCS scheduling.

Operating System Concepts with Java 8th Edition

5.29

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

Processor affinity process has affinity for processor on which it is

currently running

soft affinity

hard affinity

Operating System Concepts with Java 8th Edition

5.30

Silberschatz, Galvin and Gagne 2009

Non-uniform memory access (NUMA) and CPU

Scheduling

Processor affinity. Most SMP systems try to avoid migration of

processes from one processor to another, and instead attempt to
keep a process running on the same processor.

Operating System Concepts with Java 8th Edition

5.31

Silberschatz, Galvin and Gagne 2009

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

Memory Stall
Operating System Concepts with Java 8th Edition

5.32

Silberschatz, Galvin and Gagne 2009

Operating System Examples

Solaris scheduling
Windows XP scheduling
Linux scheduling

Operating System Concepts with Java 8th Edition

5.33

Silberschatz, Galvin and Gagne 2009

Solaris Dispatch Table

1. priority: Higher number
indicates higher priority
2. Time quantum: Higher
priority with smaller time slice
3. Time quantum expired:
Priority after using its entire
time slice,
Priority is lowered
4. Return from sleep:
Priority of a thread that is
returning from sleeping.
Priority is boosted, which is
important for good
responsive time.
Operating System Concepts with Java 8th Edition

Solaris dispatch table for time-sharing and

interactive threads
5.34

Silberschatz, Galvin and Gagne 2009

Solaris Scheduling

The kernel maintains 10

threads for servicing
interrupts, which does
NOT belong to one of six
scheduling classes.
The six classes are realtime, system, fair share,
fixed priority, timeshare,
and interactive threads.

Operating System Concepts with Java 8th Edition

5.35

Silberschatz, Galvin and Gagne 2009

Windows XP Priorities
Priority classes

Relative
priority

The initial priority of a thread is typically the base priority of the

process the thread belongs to.
The priority is boosted when a thread is released from a wait
operation. Waiting for keyboard gets more increase, and for disk
gets moderate increase.
XP distinguishes foreground and background processes.
Quantum of foreground process is increased by 3.
Operating System Concepts with Java 8th Edition

5.36

Silberschatz, Galvin and Gagne 2009

Linux Scheduling
Constant order O(1) scheduling time
Two priority ranges: time-sharing and real-time
Real-time range from 0 to 99 and nice value from

100 to 140

Two ranges map into a global priority scheme

wherein numerically lower values indicate higher

priorities.

Operating System Concepts with Java 8th Edition

5.37

Silberschatz, Galvin and Gagne 2009

Priorities and Time-slice length

Unlike Solaris and XP, Linux assigns higher priority tasks

longer time quanta and lower priority task shorter time quanta.

Operating System Concepts with Java 8th Edition

5.38

Silberschatz, Galvin and Gagne 2009

List of Tasks Indexed According to Priorities

All runnable tasks are stored in run queue which has two priority
arrays: active and expired.
The schedule chooses the task with highest priority from the
active array for execution.
The two priority arrays are exchanged when all tasks in active
arrays have exhausted their time slice.
Operating System Concepts with Java 8th Edition

5.39

Silberschatz, Galvin and Gagne 2009

Algorithm Evaluation
Deterministic modeling takes a particular predetermined

workload and defines the performance of each algorithm

for that workload

Queueing models.

Processes vary from day to day, so there is no static set of

processes to use for deterministic modeling.

Distribution of CPU and I/O bursts can be determined.

Determine if the system is stable by checking if the number of

process leaving the queue is equal to the number of processes
that arrive.

Implementation

High cost, environment changes, can be altered by system

managers or users

Operating System Concepts with Java 8th Edition

5.40

Silberschatz, Galvin and Gagne 2009

Evaluation of CPU schedulers by Simulation

Software data structure to represent the major components of

the system.
As value of a clock increases, the simulator modify the system
state to reflect activates of the devices, the processes, and the
scheduler.
The statistics will be gathered for performance of the algorithm.
Operating System Concepts with Java 8th Edition

5.41

Silberschatz, Galvin and Gagne 2009

End of Chapter 5

Operating System Concepts with Java 8th Edition

5.42

Silberschatz, Galvin and Gagne 2009

5.08

Operating System Concepts with Java 8th Edition

5.43

Silberschatz, Galvin and Gagne 2009

In-5.7

Operating System Concepts with Java 8th Edition

5.44

Silberschatz, Galvin and Gagne 2009

In-5.8

Operating System Concepts with Java 8th Edition

5.45

Silberschatz, Galvin and Gagne 2009

In-5.9

Operating System Concepts with Java 8th Edition

5.46

Silberschatz, Galvin and Gagne 2009

Dispatch Latency

Operating System Concepts with Java 8th Edition

5.47

Silberschatz, Galvin and Gagne 2009

Java Thread Scheduling

JVM Uses a Preemptive, Priority-Based Scheduling

Algorithm

FIFO Queue is Used if There Are Multiple Threads

With the Same Priority

Operating System Concepts with Java 8th Edition

5.48

Silberschatz, Galvin and Gagne 2009

Java Thread Scheduling (cont)

JVM Schedules a Thread to Run When:
1.

The Currently Running Thread Exits the Runnable State

2.

A Higher Priority Thread Enters the Runnable State

* Note the JVM Does Not Specify Whether Threads are Time-Sliced or
Not

Operating System Concepts with Java 8th Edition

5.49

Silberschatz, Galvin and Gagne 2009

Time-Slicing
Since the JVM Doesnt Ensure Time-Slicing, the yield() Method
May Be Used:
while (true) {
// perform CPU-intensive task
...
Thread.yield();
}
This Yields Control to Another Thread of Equal Priority

Operating System Concepts with Java 8th Edition

5.50

Silberschatz, Galvin and Gagne 2009

Thread Priorities
Priority

Comment

Thread.MIN_PRIORITY

Minimum Thread Priority

Thread.MAX_PRIORITY

Maximum Thread Priority

Thread.NORM_PRIORITY

Default Thread Priority

Priorities May Be Set Using setPriority() method:

setPriority(Thread.NORM_PRIORITY + 2);

Operating System Concepts with Java 8th Edition

5.51

Silberschatz, Galvin and Gagne 2009

Solaris 2 Scheduling

Operating System Concepts with Java 8th Edition

5.52

Silberschatz, Galvin and Gagne 2009

End of Chapter 5

Operating System Concepts with Java 8th Edition

5.53

Silberschatz, Galvin and Gagne 2009