Ch05 CPU Scheduling

Course 5: CPU Scheduling
Course 4: Review
Thread single, sequential stream of execution
Operating System Concepts 8th Edition
5.2
Silberschatz, Galvin and Gagne
Course 4: Review (Cont.)

Responsiveness e.g. web browser, word processor etc
Resource Sharing e.g. IPC issues
Economy (vs. process model) e.g. Solaris thread creation 30
times faster, thread context switch 5 times faster

Scalability e.g. utilization of MP architectures
5.3
Course 5: CPU Scheduling

Basic Concepts
Scheduling Algorithms
Multiple-Processor Scheduling
Operating Systems Examples
5.4
Scheduling Basic Concepts
5.5
Basic Concepts
Process scheduling aka kernel-
level thread scheduling in

threaded systems
Scheduling may apply to all the
computer resources
CPU scheduling:
Maximum CPU utilization

obtained with
multiprogramming
CPUI/O Burst Cycle

Process execution consists of
a cycle of CPU execution and
I/O wait
CPU burst distribution
5.6
Histogram of CPU-burst Times
5.7
CPU Scheduler
Selects from among the processes in memory that are ready to
execute (PCB queues), 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 (interrupt)
3. Switches from waiting to ready
4. Terminates
Scheduling under 1 and 4 is nonpreemptive/cooperative
All other scheduling is preemptive
5.8
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
5.9
Scheduling Criteria
CPU utilization keep the CPU as busy as possible [40
lightly loaded, 90 heavily used]

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)
5.10
Optimization Criteria
General
Max CPU utilization
Max throughput
Min turnaround time
Min waiting time
Min response time
Contextual:
Interactive systems minimize variance
5.11
Scheduling Algorithms
5.12
First-Come, First-Served (FCFS) Scheduling

Process
P1
P2
Burst Time
24
3
P3
3
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
5.13
FCFS Scheduling (Cont.)

Suppose that the processes arrive in the order
P2 , P3 , P1
The Gantt chart for the schedule is:
P2
P3
P1
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

FCFS not optimal for time-sharing systems
5.14
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

Two schemes:
nonpreemptive once CPU given to the process it cannot be

preempted until completes its CPU burst
preemptive if a new process arrives with CPU burst length

less than remaining time of current executing process,
preempt. This scheme is know as the
Shortest-Remaining-Time-First (SRTF)
SJF is optimal gives minimum average waiting time for a given
set of processes
5.15
Example of Non-Preemptive SJF

Process
Arrival Time
Burst Time
P1
0.0
P2
2.0
P3
4.0
P4
5.0
SJF (non-preemptive)
P1
0
P3
7
P2
8
P4
12
16
Average waiting time = (0 + 6 + 3 + 7)/4 = 4
5.16
Example of Preemptive SJF

Process
Arrival Time
Burst Time
P1
0.0
P2
2.0
P3
4.0
P4
5.0
SJF (preemptive)
P1
0
P2
2
P3
4
P2
5
P4
P1
11
16
Average waiting time = (9 + 1 + 0 +2)/4 = 3
5.17
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 .
5.18
Prediction of the Length of the Next CPU Burst
5.19
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
5.20
Priority Scheduling
A priority number (integer) is associated with each process
Priority may be calculated considering: time limits, memory
requirements, no. of open files, avg. I/O burst/avg. CPU burst

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
5.21
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
5.22
Example of RR with Time Quantum = 20

Process
P1
P2
Burst Time
53
17
P3
P4
The Gantt chart is:
P1
0
P2
20
37
68
24
P3
P4
57
P1
77
P3
97 117
P4
P1
P3
P3
121 134 154 162
Typically, higher average turnaround than SJF, but better response
5.23
Time Quantum and Context Switch Time
5.24
Turnaround Time Varies With The Time Quantum
5.25
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
5.26
Multilevel Queue Scheduling
5.27
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
5.28
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 RR. 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 RR and receives 16 additional

milliseconds. If it still does not complete, it is preempted and
moved to queue Q2.
5.29
Multilevel Feedback Queues
5.30
5.31
CPU scheduling more complex when multiple CPUs are
available
Asymmetric multiprocessing only one processor
accesses the system data structures, alleviating the need

for data sharing
Symmetric multiprocessing - each processor is self-
scheduled
5.32
Processor affinity
Most recent data in cache
If a process is switched from one processor to
another, there is a cost of invalidating and

repopulating caches
5.33
Load balancing
Workload evenly distributed across all processors
Necessary on systems with multiple queues
Affects processor affinity rule
5.34
Multicore processors
Multiple processors on the same chip
Memory stall = time waiting for data to be available when
accessing memory
In order to optimize memory stall => multithreaded cores,
each hardware thread appearing as a logical processor

Two levels of scheduling OS, hardware
5.35
Operating System Examples
5.36
Operating System Examples

Solaris scheduling
Windows XP scheduling
Linux scheduling
5.37
Solaris Scheduling
6 priority classes, default TS
Inverse relation btw priorities and
time slices
Interactive processes higher
priority, CPU-bound processes

lower priority
5.38
Solaris Dispatch Table
5.39
Windows XP Priorities
Preemptive
6 priority classes / relative priority in each class
5.40
Linux Scheduling
Two algorithms: time-sharing and real-time
Time-sharing
Prioritized credit-based process with most credits is

scheduled next
Credit subtracted when timer interrupt occurs

When credit = 0, another process chosen
When all processes have credit = 0, recrediting occurs
Based on factors including priority and history
Real-time
Soft real-time
Posix.1b compliant two classes
FCFS and RR
Highest priority process always runs first
5.41
The Relationship Between Priorities and Time-slice length
5.42
Algorithm Evaluation
Deterministic modeling takes a particular
predetermined workload and defines the performance of

each algorithm for that workload
Queueing models
Implementation
5.43
5.15
5.44
End of Course 5

Ch05 CPU Scheduling

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Ch05 CPU Scheduling

Загружено:

Авторское право:

Доступные форматы

Course 5: CPU Scheduling

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

Course 4: Review (Cont.)

times faster, thread context switch 5 times faster

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

Course 5: CPU Scheduling

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

Scheduling Basic Concepts

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

level thread scheduling in

Maximum CPU utilization

CPUI/O Burst Cycle

CPU burst distribution

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

Histogram of CPU-burst Times

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

execute (PCB queues), and allocates the CPU to one of them

1. Switches from running to waiting state

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

selected by the short-term scheduler; this involves:

switching to user mode

jumping to the proper location in the user program to restart

Dispatch latency time it takes for the dispatcher to stop one

process and start another running

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

lightly loaded, 90 heavily used]

per time unit

in the ready queue

request was submitted until the first response is produced,

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

Max CPU utilization

Min turnaround time

Min waiting time

Min response time

Interactive systems minimize variance

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

First-Come, First-Served (FCFS) Scheduling

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

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

FCFS Scheduling (Cont.)

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

Convoy effect short process behind long process

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne

Shortest-Job-First (SJF) Scheduling

these lengths to schedule the process with the shortest time

nonpreemptive once CPU given to the process it cannot be

preemptive if a new process arrives with CPU burst length

SJF is optimal gives minimum average waiting time for a given

Operating System Concepts 8th Edition

Silberschatz, Galvin and Gagne