Scheduling Algorithms

Operating System Scheduling algorithms
A Process Scheduler schedules different processes to be assigned to the CPU based on

particular scheduling algorithms. There are six popular process scheduling algorithms which
we are going to discuss in this chapter −
● First-Come, First-Served (FCFS) Scheduling
● Shortest-Job-Next / Shortest-Job-First(SJN)/SJF Scheduling
● Priority Scheduling
● Round Robin(RR) Scheduling
● Multiple-Level Queues Scheduling

These algorithms are either non-preemptive or preemptive.
1. In computing, preemption is the act of temporarily interrupting a task
being carried out by a computer system, without requiring its
cooperation, and with the intention of resuming the task at a later time.
Such changes of the executed task are known as context switches.
 Preemptive scheduling is based on priority where a scheduler
may preempt a low priority running process anytime when a high
priority process enters into a ready state
2. Non-preemptive Scheduling is a CPU scheduling technique
the process takes the resource (CPU time) and holds it till
the process gets terminated or is pushed to the waiting state.
NO PROCESS IS INTERRUPTED UNTIL IT IS COMPLETED, and
after that processor switches to another process.
3. Service time. The amount of CPU time that a process will need before it
either finishes or voluntarily exits the CPU, such as to wait for input /
output.
First Come First Serve (FCFS)

● Jobs are executed on first come, first serve basis.
● It is a non-preemptive, pre-emptive scheduling algorithm.
● Easy to understand and implement.
● Its implementation is based on FIFO queue.
● Poor in performance as average wait time is high.

Wait time of each process is as follows −
Proces Wait Time : Service Time - Arrival Time

s
P0 0-0=0
P1 5-1=4
P2 8-2=6
P3 16 - 3 = 13
Average Wait Time: (0+4+6+13) / 4 = 5.75
Shortest Job Next (SJN)

● This is also known as shortest job first, or SJF
● This is a non-preemptive, pre-emptive scheduling algorithm.
● Best approach to minimize waiting time.
● Easy to implement in Batch systems where required CPU time is known in

advance.
● Impossible to implement in interactive systems where required CPU time is

not known.
● The processer should know in advance how much time process will take.
Given: Table of processes, and their Arrival time, Execution time
Process Arrival Time Execution Time Service Time
P0 0 5 0
P1 1 3 5
P2 2 8 14
P3 3 6 8
Gantt Chart
P1 P0 P3 P2
0 3 8 14 22
Waiting time of each process is as follows −
Proces Waiting Time

s
P0 0-0=0
P1 5-1=4
P2 14 - 2 = 12
P3 8-3=5
Average Wait Time: (0 + 4 + 12 + 5)/4 = 21 / 4 = 5.25
Priority Based Scheduling

● Priority scheduling is a non-preemptive algorithm and one of the most
common scheduling algorithms in batch systems.
● Each process is assigned a priority. Process with highest priority is to be

executed first and so on.
● Processes with same priority are executed on first come first served basis.
● Priority can be decided based on memory requirements, time requirements

or any other resource requirement.
Given: Table of processes, and their Arrival time, Execution time, and priority. Here
we are considering 1 is the Highest priority.
Process Arrival Time Execution Time Priority Service Time
P0 0 5 1 0
P1 1 3 2 11
P2 2 8 1 14
P3 3 6 3 5
Gantt Chart
P0 P2 P1 P3
0 5 13 16 22
Waiting time of each process is as follows −

Proces Waiting Time
s
P0 0-0=0
P1 11 - 1 = 10
P2 14 - 2 = 12
P3 5-3=2
Average Wait Time: (0 + 10 + 12 + 2)/4 = 24 / 4 = 6
Round Robin Scheduling

● Round Robin is the preemptive process scheduling algorithm.
● Each process is provided a fix time to execute, it is called a quantum.
● Once a process is executed for a given time period, it is preempted and other
process executes for a given time period.
● Context switching is used to save states of preempted processes.
Process Arrival Time Execution Time Priority Service Time
P0 0 5 1 0
P1 1 3 2 11
P2 2 8 1 14
P3 3 6 3 5
Wait time of each process is as follows −

Proces Wait Time : Service Time - Arrival Time
s
P0 (0 - 0) + (12 - 3) = 9
P1 (3 - 1) = 2
P2 (6 - 2) + (14 - 9) + (20 - 17) = 12
P3 (9 - 3) + (17 - 12) = 11
Average Wait Time: (9+2+12+11) / 4 = 8.5
Multiple-Level Queues Scheduling

Multiple-level queues are not an independent scheduling algorithm. They make use
of other existing algorithms to group and schedule jobs with common
characteristics.
● Multiple queues are maintained for processes with common characteristics.
● Each queue can have its own scheduling algorithms.
● Priorities are assigned to each queue.

For example, CPU-bound jobs can be scheduled in one queue and all I/O-bound
jobs in another queue. The Process Scheduler then alternately selects jobs from
each queue and assigns them to the CPU based on the algorithm assigned to the
queue.

Scheduling Algorithms

Uploaded by

Copyright:

Available Formats

Scheduling Algorithms

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Scheduling Algorithms

Uploaded by

Copyright:

Available Formats

Operating System Scheduling algorithms

A Process Scheduler schedules different processes to be assigned to the CPU based on

● First-Come, First-Served (FCFS) Scheduling

● Shortest-Job-Next / Shortest-Job-First(SJN)/SJF Scheduling

● Round Robin(RR) Scheduling

● Multiple-Level Queues Scheduling

First Come First Serve (FCFS)

● It is a non-preemptive, pre-emptive scheduling algorithm.

● Easy to understand and implement.

● Its implementation is based on FIFO queue.

● Poor in performance as average wait time is high.

Proces Wait Time : Service Time - Arrival Time

Average Wait Time: (0+4+6+13) / 4 = 5.75

Shortest Job Next (SJN)

● This is a non-preemptive, pre-emptive scheduling algorithm.

● Best approach to minimize waiting time.

● Easy to implement in Batch systems where required CPU time is known in

● Impossible to implement in interactive systems where required CPU time is

Given: Table of processes, and their Arrival time, Execution time

Process Arrival Time Execution Time Service Time

Waiting time of each process is as follows −

Proces Waiting Time

Average Wait Time: (0 + 4 + 12 + 5)/4 = 21 / 4 = 5.25

Priority Based Scheduling

● Each process is assigned a priority. Process with highest priority is to be

● Priority can be decided based on memory requirements, time requirements

Process Arrival Time Execution Time Priority Service Time

Waiting time of each process is as follows −

Average Wait Time: (0 + 10 + 12 + 2)/4 = 24 / 4 = 6

Round Robin Scheduling

● Each process is provided a fix time to execute, it is called a quantum.

● Context switching is used to save states of preempted processes.

Process Arrival Time Execution Time Priority Service Time

Wait time of each process is as follows −

P2 (6 - 2) + (14 - 9) + (20 - 17) = 12

Average Wait Time: (9+2+12+11) / 4 = 8.5

Multiple-Level Queues Scheduling

● Multiple queues are maintained for processes with common characteristics.

● Each queue can have its own scheduling algorithms.

● Priorities are assigned to each queue.

You might also like