CPU SCHEDULING
PROCESS CONCEPT
An operating system executes a variety of programs:
Batchsystem – jobs
Time-shared systems – user programs or tasks
Process – a program in execution; process execution
must progress in sequential fashion.
Operating System Concepts
PROCESS STATE
As a process executes, it changes state
new: The process is being created.
running: Instructions are being executed.
waiting: The process is waiting for some event to occur.
ready: The process is waiting to be assigned to a process.
terminated: The process has finished execution.
Operating System Concepts
PROCESS CONTROL BLOCK (PCB)
Information associated with each process.
Process state
Program counter
CPU registers
CPU scheduling information
Memory-management information
Accounting information
I/O status information
Operating System Concepts
PROCESS SCHEDULING QUEUES
Job queue – set of all PCBs in the system.
Ready queue – set of all processes residing in main
memory, ready and waiting to execute.
Device queues – set of processes waiting for an I/O
device.
PCB migration between the various queues.
Operating System Concepts
READY QUEUE AND VARIOUS I/O DEVICE QUEUES
Operating System Concepts
REPRESENTATION OF PROCESS
SCHEDULING
Operating System Concepts
CONTEXT SWITCH
When CPU switches to another process, the system
must
Save the state of the old process
Load the saved state for the new process.
Operating System Concepts
CPU SWITCH FROM PROCESS TO
PROCESS
Operating System Concepts
Long term scheduling: which determines which
programs are admitted to the system for execution and
when, and which ones should be exited.(disk to
memory)
Medium term scheduling: which determines when
processes are to be suspended and resumed;
Short term scheduling (or dispatching): which
determines which of the ready processes can have CPU
resources, and for how long.(disk to CPU)
DISPATCHER
Dispatcher module gives control of the CPU to the
process selected by the CPU scheduler. This
involves:
Switching context
Switching to user mode
Setting the PC
Dispatch latency is the time taken to stop one process
and start another
Operating System Concepts
CPU SCHEDULING
Basic Concepts
Scheduling Criteria
Scheduling Algorithms
Thread Scheduling
Multiple-Processor Scheduling
Operating Systems Examples
Algorithm Evaluation
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
CPU scheduling determines which process to run when
there are multiple runnable processes
CPU scheduling is important because it can have big
effect on resource utilization and overall performance of
the system
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
IO bound processes: are the processes that perform lots of
IO operations. Each IO operation is followed by a short
CPU burst to process the IO, then more IO happens.
CPU bound processes: processes that perform lots of
computations and do little IO. Tend to have a few long CPU
bursts.
ALTERNATING SEQUENCE OF CPU AND I/O
BURSTS
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
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
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)
SCHEDULING ALGORITHM OPTIMIZATION
CRITERIA
Max CPU utilization
Max throughput
Min turnaround time
Min waiting time
Min response time
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
FCFS SCHEDULING (CONT)
Suppose that the processes arrive in the order
P2 , P3 , P1
The Gantt chart
P2 for the
P3 schedule is: 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
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
EXAMPLE OF SJF
ProcessArrival TimeBurst Time
P1 0.0 6
P2 2.0 8
P3 4.0 7
P4 5.0 3
P4 P3 P2
SJF scheduling chartP1
0 3 9 16 24
Average waiting time = (3 + 16 + 9 + 0) / 4 = 7
DETERMINING LENGTH OF NEXT CPU
BURST
Can only estimate the length
Can be done by using the length of previous CPU bursts,
1. t n actual
using exponential length of n th CPU burst
averaging
2. n 1 predicted value for the next CPU burst
3. , 0 1
4. Define : n 1 t n 1 n .
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
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
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
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
TIME QUANTUM AND CONTEXT SWITCH
TIME
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
Batch system : In batch systems,typically want good
throughput or trunaround time.
Intractive system: In this systems both of this are
important but response time is given primary
consideration
MULTILEVEL QUEUE SCHEDULING
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
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.
MULTILEVEL FEEDBACK QUEUES
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
END
