2.

4 CPU scheduling

02/04/2025 Bahir Dar University OS(CoSc 1

2034)
 Contents:
Introduction to scheduling
Categories of scheduling algorithm
CPU scheduling
Scheduling criteria
Scheduling algorithms
Multiprocessor scheduling
Threads scheduling

02/04/2025 Bahir Dar University OS(CoSc 2

2034)
 Introduction to scheduling

 When a computer is multiprogrammed, it frequently has

multiple processes competing for the CPU at the same time.
 When more processes are there in the ready state than the
number of available CPUs, the operating system must decide
which process to run first.
 The part of the operating system that makes the choice is called
the scheduler and the algorithm it uses is called the scheduling
algorithm.

02/04/2025 Bahir Dar University OS(CoSc 3

2034)
 Process scheduling queues
o The objective of multi-programming
– To have some process running at all times.
o Timesharing: Switch the CPU frequently that users can interact
the program while it is running.
o If there are many processes, the rest have to wait until CPU is
free.
o Scheduling is to decide which process to execute and when.
o Scheduling queues:-Several queues used for scheduling:
a) Job queue – set of all processes in the system.
b) Ready queue – set of all processes residing in main memory,
ready and waiting to execute.
c) Device queues – set of processes waiting for an I/O device.
• Each device has its own queue.
o Process migrates between
02/04/2025 the various
Bahir Dar University queues during its life time.
OS(CoSc 4
2034)
 schedulers
o A process in a job-queue is selected in some fashion and
assigned to memory/CPU.
o The selection process is carried out by a scheduler. Schedulers
are of three types:
1. Long-term scheduler (or job scheduler) – selects which
processes should be brought into the ready queue from the
job queue (determine the degree of multi-programming)

2. Short-term scheduler (or CPU scheduler) – selects which

process should be executed next and allocates CPU

3. Medium-term ( or Emergency) scheduler: swap out the

process from memory (ready queue) and swapped in again
later (it decrease the degree of multiprogramming).
02/04/2025 Bahir Dar University OS(CoSc 5
2034)
 Passive
Programs

Disk Memory

Long Term Short Term

Scheduler Scheduler
Open
program
Process CPU
CPU
Select a Assign the
process CPU to a
from job to process
ready queue from ready
queue

Swap a Process
process
Job (input) from ready
to job queue
Queue
Medium Term
02/04/2025
Scheduler Bahir Dar University OS(CoSc2034) 6
Degree of multi-programming is the number of processes
that are placed in the ready queue waiting for execution
by the CPU.

Process 1
Process 2
Process 3 Degree of
Process 4 Multi-Programming
Process 5

Memory

02/04/2025 Bahir Dar University OS(CoSc 7

2034)
• Since Long term scheduler selects which processes to
brought to the ready queue, hence, it increases the degree
of multiprogramming.

Long Term
Process 1
Disk Scheduler Process 2
Process 3 Degree of
Process 4 Multi-Programming
Process 5

Memory
Job Queue

02/04/2025 Bahir Dar University OS(CoSc 8

2034)
 Since Medium term scheduler picks some processes from
the ready queue and swap them out of memory, hence, it
decreases the degree of multiprogramming.

Medium Term
Process 1
Disk Scheduler Process 2
Process 3 Degree of
Process 4 Multi-Programming
Process 5

Memory
Job Queue

02/04/2025 Bahir Dar University OS(CoSc 9

2034)
 Categories of Scheduling Algorithms
For different environments different scheduling algorithms are
needed.
This situation arises because different application areas (and
different kinds of operating systems) have different goals.
Three environments worth distinguishing are
Batch.
Interactive.
Real time.
In batch systems, there are no users impatiently waiting at their
terminals for a quick response.
This approach reduces process switches and thus improves
performance.

02/04/2025 Bahir Dar University OS(CoSc 10

2034)
 Categories of Scheduling Algorithms(con’t..)
o In an environment with interactive users, preemption is
essential to keep one process from hogging the CPU and
denying service to the others.
o Even if no process intentionally ran forever, due to a
program bug, one process might shut out all the others
indefinitely.
o Preemption is needed to prevent this behavior.
o In systems with real-time constraints, preemption is, oddly
enough, sometimes not needed because the processes
know that they may not run for long periods of time and
usually do their work and block quickly.
o The difference with interactive systems is that real-time
systems run only programs that are intended to further the
application at hand. Interactive systems are general purpose
and may run arbitrary
02/04/2025
programs thatOS(CoSc
Bahir Dar University
are not cooperative or 11
2034)
 Categories of Scheduling Algorithms(con’t..)
o Scheduling algorithms can be divided into two categories
with respect to how they deal with clock interrupts.
Preemptive scheduling: allows releasing the current
executing process from CPU when another process (which
has a higher priority) comes and need execution.

Non-preemptive scheduling: once the CPU has been

allocated to a process, the process keeps the CPU until it
release the CPU .

02/04/2025 Bahir Dar University OS(CoSc 12

2034)
 Preemptive
Scheduling

CPU

Non- Preemptive
Scheduling

CPU
02/04/2025 Bahir Dar University OS(CoSc 13
2034)
 CPU
Scheduling

02/04/2025 Bahir Dar University OS(CoSc 14

2034)
 CPU scheduling
CPU Scheduling is the method to select a process from the ready
queue to be executed by CPU when ever the CPU becomes idle.
o 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

Bahir Dar University

15 02/04/2025
OS(CoSc2034)
 Scheduling Criteria
CPU Utilization:
The percentage of times while CPU is busy to the total time ( times
CPU busy + times it is idle). Hence, it measures the benefits from CPU.

To maximize utilization, keep CPU as busy as possible.

CPU utilization range from 40% (for lightly loaded systems) to 90% (for
heavily loaded) (Explain why? CPU utilization can not reach 100%,
because of the context switch between active processes).

Times CPU Busy

CPU Utilizatio n  *100
Total Time

Bahir Dar University

16 02/04/2025
OS(CoSc2034)
System Throughput:
 The number of process that are completed per time unit (hour)

Turnaround time:
 For a particular process, it is the total time needed for process execution
(from the time of submission to the time of completion).
 It is the sum of process execution time and its waiting times (to get memory,
perform I/O, ….).

Waiting time:
 The waiting time for a specific process is the sum of all periods it spends
waiting in the ready queue.

Response time.
 It is the time from the submission of a process until the first response is
produced (the time the process takes to start responding).

02/04/2025 Bahir Dar University OS(CoSc 17

2034)
 It is desirable to:

Maximize:
CPU utilization.
System throughput.

Minimize:
Turnaround time.
Waiting time.
Response time.

02/04/2025 Bahir Dar University OS(CoSc 18

2034)
 Scheduling Algorithms
First Come First Serviced (FCFS) algorithm
 The process that comes first will be executed first.
 Not preemptive(The first job is allowed to run as long as it
wants to be executed.).
 It is easy to understand and equally easy to program.
 With this algorithm, a single linked list keeps track of all
ready processes.
Weakness
 A single process may egoistically control the CPU time.
 It is not good for time sharing tasks.
 FCFS—discriminates against short jobs since any short
jobs arriving after long jobs will have a longer waiting
time.
02/04/2025 Bahir Dar University OS(CoSc 19
2034)
 First Come First Serviced (FCFS) algorithm(con’t..)

Ready queue

FCFS Scheduling

CPU

02/04/2025 Bahir Dar University OS(CoSc 20

2034)
Consider the following set of processes, with the length of the CPU burst
(Execution) time given in milliseconds:
Burst Time Process
The processes arrive in the order 11 24 P1
P1, P2, P3. All at time 0. 22 3 P2
3 P3
33

 Gant chart:

 waiting times and turnaround times for each process are:

P3 P2 P1 Process
27 24 0 Waiting Time (WT)
30 27 24 Turnaround Time (TAT)
+
Execution
21
Bahir Dar University
02/04/2025 Time
 Hence, average waiting time= (0+24+27)/3=17 milliseconds
OS(CoSc2034)
Repeat the previous example, assuming that the processes arrive in the order
P2, P3, P1. All at time 0.

Burst Time Process

33 24 P1
11 3 P2

22 3 P3

 Gant chart:

 waiting times and turnaround times for each process are:

P3 P2 P1 Process
3 0 6 Waiting Time (WT)
6 3 30 Turnaround Time (TAT)

Bahir Dar University

22 02/04/2025
 Hence, average waiting time= (6+0+3)/3=3 milliseconds
OS(CoSc2034)
 Shortest-Job-First (SJF) scheduling
• When CPU is available, it will be assigned to the process with
the smallest CPU burst (non preemptive).
 If two processes have the same next CPU burst, FCFS is used.
 Shortest job first is provably optimal when all the jobs are
available simultaneously.
 Mainly used in the long-term-scheduler.
SJF Scheduling

10 5 18 7
X
18 10 7 5

CPU
Note: numbers indicates the
02/04/2025 process
Bahir Dar University execution time
OS(CoSc 23
2034)
Consider the following set of processes, with the length of the CPU burst time
given in milliseconds:
Burst Time Process
The processes arrive in the order 6 P1
P1, P2, P3, P4. All at time 0. 8 P2
7 P3
3 P4

1. Using FCFS
 Gant chart:

 waiting times and turnaround times for each process are:

P4 P3 P2 P1 Process
21 14 6 0 Waiting Time (WT)
24 21 14 6 Turnaround Time (TAT)

Bahir Dar University

24 02/04/2025
 Hence, average waiting time= (0+6+14+21)/4=10.25 milliseconds
OS(CoSc2034)
2. Using SJF Burst Time Process
6 P1
8 P2
 7 P3
Gant chart:
3 P4

 waiting times and turnaround times for each process are:

P4 P3 P2 P1 Process
0 9 16 3 Waiting Time (WT)
3 16 24 9 Turnaround Time (TAT)

 Hence, average
25 waiting time= (3+16+9+0)/4=7 milliseconds
Bahir Dar University
02/04/2025
OS(CoSc2034)
 Shortest-Remaining-Time-First (SRTF)
 It is a preemptive version of the Shortest Job First
 It allows a new process to gain the processor if its execution
time less than the remaining time of the currently processing
one.
 When a new job arrives, its total time is compared to the
current process' remaining time.
 If the new job needs less time to finish than the current process,
the current process is suspended and the new job started
SRTF Scheduling

2 10 7 5 3
4

CPU

02/04/2025 Bahir Dar University OS(CoSc 26

2034)
Consider the following set of processes, with the length of the CPU burst time
given in milliseconds:
Arrival Time Burst Time Process
The processes arrive in the order 0 7 P1
P1, P2, P3, P4. as shown in table. 2 4 P2
4 1 P3
5 4 P4

1. Using SJF
 Gant chart:

 waiting times and turnaround times for each process are:

P4 P3 P2 P1 Process
7 3 6 0 Waiting Time (WT)
11 4 10 7 Turnaround Time (TAT)

Bahir Dar University

27 02/04/2025
 Hence, average waiting time= (0+6+3+7)/4=4 milliseconds
OS(CoSc2034)
2. Using SRTF Arrival Time Burst Time Process
0 7 P1
2 4 P2
4 1 P3
 Gant chart:
5 4 P4

 waiting times and turnaround times for each process are:

P4 P3 P2 P1 Process
2 0 1 9 Waiting Time (WT)
6 1 5 16 Turnaround Time (TAT)

 Hence, average
28 waiting time= (9+1+0+2)/4=3 milliseconds
Bahir Dar University
02/04/2025
OS(CoSc2034)
 Round Robin scheduling
• Is one of the oldest, simplest, fairest, and most widely used
algorithms.
 Allocate the CPU for one Quantum time (also called time slice)
Q to each process in the ready queue.
 If the process has blocked or finished before the quantum has
elapsed, the CPU switching is done when the process blocks, of
course.
 This scheme is repeated until all processes are finished.
 A new process is added to the end of the ready queue.
 setting the quantum too short causes too many process
switches and lowers the CPU efficiency, but setting it too long
may cause poor response to short interactive requests.

02/04/2025 Bahir Dar University OS(CoSc 29

2034)
 Round Robin scheduling(con’t..)
• A quantum of around 20-50 msec is often a reasonable
compromise
• RR—treats all jobs equally (giving them equal bursts of CPU
time) so short jobs will be able to leave the system faster since
they will finish first.

Round Robin Scheduling

Q Q
Q Q

CPU
02/04/2025 Bahir Dar University OS(CoSc 30
2034)
Consider the following set of processes, with the length of the CPU burst time given in
milliseconds:
Burst Time Process
The processes arrive in the order 24 P1
P1, P2, P3. All at time 0.
3 P2
use RR scheduling with Q=2 and Q=4
3 P3

RR with Q=4

 Gant chart:

 waiting times and turnaround times for each process are:

P3 P2 P1 Process
7 4 6 Waiting Time (WT)
10 7 30 Turnaround Time (TAT)

Bahir Dar University

31 02/04/2025
 Hence, average waiting time= (6+4+7)/3=5.66
OS(CoSc2034) milliseconds
RR with Q=2 Burst Time Process
24 P1
3 P2
3 P3

 Gant chart:

 waiting times and turnaround times for each process are:

P3 P2 P1 Process
7 6 6 Waiting Time (WT)
10 9 30 Turnaround Time (TAT)

 Hence, average
32 waiting time= (6+6+7)/3=6.33 milliseconds
Bahir Dar University
02/04/2025
OS(CoSc2034)
Explain why? If the quantum time decrease, this will slow down
the execution of the processes.

Sol:

Because decreasing the quantum time will increase the

context switch (the time needed by the processor to switch
between the processes in the ready queue) which will
increase the time needed to finish the execution of the active
processes, hence, this slow down the system.

02/04/2025 Bahir Dar University OS(CoSc 33

2034)
 Priority scheduling
 A priority number (integer) is associated with each process
 The CPU is allocated to the process with the highest priority (smallest integer).
 It is often convenient to group processes into priority classes and use priority
scheduling among the classes but round-robin scheduling within each class.
 There are two types:
 Preemptive
 nonpreemptive

Priority Scheduling

10 5 18 7
X
18 10 7 5

CPU
Note:
02/04/2025 numbers indicates the
Bahir Dar process priority
University OS(CoSc 34
2034)
Problems with Priority scheduling

Problem  Starvation (infinite blocking)– low priority

processes may never execute
Solution  Aging – as time progresses increase the priority of
the process

Very lowVery
priority
low process
priority process

8 28
26 30
8 5 4 2

Starvation
Aging
02/04/2025 Bahir Dar University OS(CoSc 35
2034)
Consider the following set of processes, with the length of the CPU burst time
given in milliseconds:
priority Burst Time Process
3 10 P1
The processes arrive in the order
1 1 P2
P1, P2, P3, P4, P5. All at time 0.
4 2 P3
5 1 P4
2 5 P5
1. Using priority scheduling
 Gant chart:

 waiting times and turnaround times for each process are:

P5 P4 P3 P2 P1 Process
1 18 16 0 6 Waiting Time (WT)
6 19 18 1 16 Turnaround Time (TAT)

Bahir Dar University

36 02/04/2025
 Hence, average waiting time= (6+0+16+18+1)/5=8.2 milliseconds
OS(CoSc2034)
 Multi-level queuing scheduling
• 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
There are two types:
Without feedback: processes can not move between queues.
With feedback: processes
02/04/2025 can moveOS(CoSc
Bahir Dar University between queues. 37
2034)
 Multi-level queuing without feedback:

• Divide ready queue into several queues.

• Each queue has specific priority and its own
scheduling algorithm (FCFS, …).

High priority Queue

02/04/2025 Bahir Dar University

Low priority Queue OS(CoSc 38
2034)
Multi-level queuing with feedback:
 Divide ready queue into several queues.
 Each queue has specific Quantum time as shown in figure.
 Allow processes to move between queues.

Queue 0

Queue 1

Queue 2

02/04/2025 Bahir Dar University OS(CoSc 39

2034)
 Multiple-Processor Scheduling
•CPU scheduling more complex when multiple CPUs are available.
• In Symmetric Multiprocessors systems all CPUs can perform
scheduling independently(complex task).
• Asymmetric multiprocessor systems :- only one processor(Master
CPU) handles all the scheduling tasks.
•Asymmetric multiprocessing – only one processor accesses the system
data structures, alleviating the need for data sharing.
•Load sharing :Load must be fairly distributed among processors to
maximize processors use. Load balancing is especially important when
each processor has its own private queue.
•Two general approaches.
• push migration:- keeping load balance by pushing processes
from overloaded processor to an idle one.
• pull migration:-an idle processor pulls processes from an
02/04/2025
overloaded one.Bahir Dar University OS(CoSc 40
2034)
 Thread scheduling
•Recall that there are two types of threads.
User level threads and kernel level threads.
•On OS systems supporting them, it is kernel-level-threads -not
processes- that are scheduled by the operating system.
•User level-threads are managed by the thread library, and the kernel
is unaware of them.
•To run on CPU, user-level threads must be mapped to an associated
kernel level thread
•On systems implementing many-to-one and many-to-many models,
the thread library schedules user level-thread threads on the
available resources this scheme is called process contention
scope(PCS)- (since threads of same process compete for CPU).
•To decide which kernel-thread to schedule to CPU the kernel uses
system-contention-schedule(SCS). Competition for CPU with SCS
takes pace among all threads in the system. Systems using one -to-
one models(such as windows
02/04/2025 XP, Solaris 9,
Bahir Dar University
2034)
Linux) uses only SCS. 41
OS(CoSc
 Any Questions?

02/04/2025 Bahir Dar University OS(CoSc 42

2034)