CPU Scheduling

1
 Processor Scheduling
• Aim is to assign processes to be executed by the
processor in a way that meets system objectives, such as
response time, throughput, and processor efficiency.
• Broken down into three separate functions:

long mediu short

term m term term
sched sched sched
uling uling uling 2
Types of Scheduling

3
Scheduling and Process State
Transitions

4
Figure 9.2
Nesting of
Scheduling
Functions

5
6
 Nonpreemptive vs Preemptive

Nonpreemptive Preemptive
– currently running
process may be
– once a process is in interrupted and
the running state, it moved to ready state
will continue until it by the OS
terminates or blocks – preemption may
itself for I/O occur when a new
process arrives, on an
interrupt, or
periodically
 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

8
Alternating Sequence of CPU
And I/O Bursts

9
 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 non preemptive
• All other scheduling is preemptive
10
 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

11
 Scheduling Criteria
• CPU utilization – keep the CPU as busy as
possible
• Throughput – Number of processes that
complete their execution per time unit
• Turnaround time – amount of time to execute a
particular process
TAT= W.T. +B.T.
• 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)
12
 Scheduling Algorithm
Optimization Criteria
• Max CPU utilization
• Max throughput
• Min turnaround time
• Min waiting time
• Min response time

13
 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
14
 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
• Convoy effect short process behind long process
• Non preemptive, troublesome for time sharing
15
system.
 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
• Appropriate term – Shortest Next CPU
Burst Algo.
• 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
16
 Example of SJF
Process Burst Time
P1 6
P2 8
P3 7
P4 3

• SJF scheduling chart

P4 P1 P3 P2

0 3 9 16 24

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

Average waiting time (FCFS) = ( 0+6+14+21)= 10.25

17
 SJF Scheduling (Cont.)
• SJF can be either preemptive or non
preemptive.
• Preemptive SJF -
 When new process arrives in the ready
queue whose CPU bust time is smaller
than execution time remaining for currently
executing process. Then in that situation
currently executed process is preempted.
 Preemptive SJF is called Shortest
Remaining Time First ( SRTF).
18
 SJF Scheduling (Cont.)
• Non Preemptive SJF -
Allows the currently running process to
finish its CPU burst .

19
 Example of SRTF
Process Arrival Time Burst Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5

20
 Priority Scheduling
• A priority number (integer) is associated with
each process
• The CPU is allocated to the process with the
highest priority (Assume smallest integer 
highest priority)
• Priority scheduling algorithm can either be
Preemptive and nonpreemptive
• SJF is a priority scheduling where priority is the
predicted next CPU burst time
• Problem  Starvation (Indefinite blocking) –
low priority processes may never execute
• Solution  Aging – as time progresses increase
the priority of the
21
Priority Scheduling Example
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 4
P4 1 5
P5 5 2

22
 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

23
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

Avg. W.T =(10-4) + 4 + 7/3 = 17 /3 = 5.66ms

Typically, higher average turnaround than SJF, but better
response.

24
Time Quantum and Context Switch Time

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
26
Multilevel Queue Scheduling

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

28
Example 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.
29
Multilevel Feedback Queues

30
 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

31
 Thread Scheduling Approaches
• Load Sharing –
Pool of thread is maintained & when processor
become idle then scheduler selects thread from
ready queue.
• Gang Scheduling-
Related threads are chosen and are scheduled for
execution with same processor . This support co-
operative scheduling.

32
 Thread Scheduling Approaches
• Dedicated processor assignment –
Each program is allocated to number of CPU’s by
distribution equal number of threads till completion
of program execution.
• Dynamic Scheduling -
By the time of execution continues total number of
threads in use will vary since some threads may
exit memory after completion.

33