Process Scheduling

Process Scheduling
 Scheduling of processes/work is done to finish the work on time.
 CPU Scheduling is a process that allows one process to use the
CPU while another process is delayed (in waiting state) due to
unavailability of any resources such as I / O etc, thus making full use
of the CPU.
 The purpose of CPU Scheduling is to make the system more
efficient, faster, and fairer.
 Whenever the CPU becomes idle, the operating system must select
one of the processes in the line ready for launch.
 The selection process is done by a CPU scheduler.
 The main function of the CPU scheduling is to ensure that whenever
the CPU remains idle, the OS has at least selected one of the
processes available in the ready-to-use line.
 Terminologies for CPU Scheduling
 Arrival Time: Time at which the process arrives in the ready
queue.
 Completion Time: Time at which process completes its
execution.
 Burst Time: Time required by a process for CPU execution.
 Turn Around Time: Time Difference between completion time
and arrival time.
Turn Around Time = Completion Time – Arrival Time
 Waiting Time(W.T): Time Difference between turn around time
and burst time
Waiting Time = Turn Around Time – Burst Time
 Response Time: Response time is the time spent when the
process is in the ready state and gets the CPU for the first time
 What are the different types of CPU
Scheduling Algorithms?
 There are mainly two types of scheduling methods:
 Preemptive Scheduling:
1. The resources (mainly CPU cycles) are allocated to the
process for a limited amount of time and then taken away,
and the process is again placed back in the ready queue if
that process still has CPU burst time remaining.
2. That process stays in the ready queue till it gets its next
chance to execute.

Scheduling Algorithms:
Round Robin (RR),
Shortest Remaining Time First (SRTF),
Priority (preemptive version), etc.
 What are the different types of CPU
Scheduling Algorithms?
 There are mainly two types of scheduling methods:
 Non-Preemptive Scheduling:
1. In this scheduling, once the resources (CPU cycles) are
allocated to a process, the process holds the CPU till it gets
terminated or reaches a waiting state.
2. In the case of non-preemptive scheduling does not interrupt
a process running CPU in the middle of the execution.
3. Instead, it waits till the process completes its CPU burst
time, and then it can allocate the CPU to another process.
Scheduling Algorithms:
Shortest Job First (SJF basically non preemptive) and
Priority (non preemptive version), etc.
 Preemptive vs Non- Preemptive
Scheduling
Preemptive Scheduling

Non-Preemptive Scheduling
 Different types of CPU Scheduling
Algorithms
Priority Scheduling

Longest Remaining Job First

Preemptive
Shortest Remaining Job First

Round-Robin
CPU Scheduling
Shortest Job First

First-Come First-Serve
Non-Preemptive
Longest Job First

Highest Response Ratio Next

 Key Differences between Preemptive
and Non-Preemptive Scheduling
Parameter PREEMPTIVE SCHEDULING NON-PREEMPTIVE SCHEDULING
Once resources(CPU Cycle) are
In this resources(CPU Cycle)
allocated to a process, the process
Basic are allocated to a process for a
holds it till it completes its burst time
limited time.
or switches to waiting state.
Process can be interrupted in Process can not be interrupted until it
Interrupt
between. terminates itself or its time is up.
If a process having high priority If a process with a long burst time is
frequently arrives in the ready running CPU, then later coming
Starvation
queue, a low priority process process with less CPU burst time
may starve. may starve.
It has overheads of scheduling
Overhead It does not have overheads.
the processes.
Flexibility flexible rigid
 Key Differences Between Preemptive
and Non-Preemptive Scheduling

Parameter PREEMPTIVE SCHEDULING NON-PREEMPTIVE SCHEDULING

CPU In preemptive scheduling, CPU It is low in non preemptive
Utilization utilization is high. scheduling.
Waiting Preemptive scheduling waiting Non-preemptive scheduling waiting
Time time is less. time is high.
Response Preemptive scheduling Non-preemptive scheduling
Time response time is less. response time is high.
Examples of preemptive
Examples of non-preemptive
scheduling are Round Robin
Examples scheduling are First Come First
and Shortest Remaining Time
Serve and Shortest Job First.
First.
Preemptive CPU Scheduling Algorithm
 1. Priority Scheduling

 Preemptive Priority CPU Scheduling Algorithm is a pre-emptive

method of CPU scheduling algorithm that works based on the
priority of a process.
 In this algorithm, the editor sets the functions to be as important,
meaning that the most important process must be done first.
 In the case of any conflict, that is, where there are more than one
processor with equal value, then the most important CPU planning
algorithm works on the basis of the FCFS (First Come First Serve)
algorithm.
 1. Priority Scheduling
Characteristics of Priority Scheduling:
 Schedules tasks based on priority.
 When the higher priority work arrives while a task with less priority is
executed, the higher priority work takes the place of the less priority
one and the latter is suspended until the execution is complete.
 Lower is the number assigned, higher is the priority level of a process.
Advantages of Priority Scheduling:
• The average waiting time is less than FCFS
• Less complex
Disadvantages of Priority Scheduling:
• One of the most common demerits of the Preemptive priority CPU
scheduling algorithm is the Starvation Problem.
• Starvation Problem is the problem in which a process has to wait
for a longer amount of time to get scheduled into the CPU. This
condition is called the starvation problem.
 1. Priority Scheduling

 Example:
 Consider the following table of arrival time, Priority and burst time for
five processes P1, P2, P3, P4 and P5

Input :
Process_no arrival_time Burst_time priority
P1 0 3 2
P2 1 6 1
P3 2 1 3
P4 3 2 3
P5 4 4 2
 Priority Process Schedulling Algorithm
Preemptive:
INPUT :
Process_no arrival_time Burst_time priority
P1 0 3 2
P2 1 6 1
P3 2 1 3
P4 3 2 3
P5 4 4 2
Gantt Chart:
0 1 7 9 13 14 16
P1 P2 P1 P5 P3 P4

OUTPUT: Complete_time - Turn_Around_Time -

arrival_time Burst_time

P_no arrival_time Burst_time priority Complete_time Turn_Around_Time Waiting_Time

P1 0 3 2 9 9 6
P2 1 6 1 7 6 0
P3 2 1 3 14 12 11
P4 3 2 3 16 13 11
P5 4 4 2 13 9 5
Average = 9.8 6.6
 Priority Process Schedulling Algorithm
Non-Preemptive:
INPUT :
Process_no arrival_time Burst_time priority
P1 0 3 2
P2 1 6 1
P3 2 1 3
P4 3 2 3
P5 4 4 2
Gantt Chart:
0 3 9 13 14 16
P1 P2 P5 P3 P4

OUTPUT: Complete_time - Turn_Around_Time -

arrival_time Burst_time

P_no arrival_time Burst_time priority Complete_time Turn_Around_Time Waiting_Time

P1 0 3 2 3 3 0
P2 1 6 1 9 8 2
P3 2 1 3 14 12 11
P4 3 2 3 16 13 11
P5 4 4 2 13 9 5
Average = 9.0 5.8