Scribd
Upload
54 views22 pages

CPU - Scheduling Research Methodology

The document proposes a new multilevel CPU scheduling algorithm that aims to optimize utilization of the CPU and handle different types of processes efficiently. It begins with background on CPU scheduling and discusses common scheduling algorithms like FCFS, SJF, priority scheduling, and round robin. The proposed algorithm calculates time quantum based on process burst times, shuffles processes in ascending order of burst time, and allocates CPU based on time quantum or process completion. It is claimed to provide optimum waiting time, turnaround time, response time and throughput while avoiding starvation issues of long processes. A comparison of the algorithms shows the proposed approach provides improvements over existing methods.

Uploaded by

says hello
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
54 views22 pages

CPU - Scheduling Research Methodology

The document proposes a new multilevel CPU scheduling algorithm that aims to optimize utilization of the CPU and handle different types of processes efficiently. It begins with background on CPU scheduling and discusses common scheduling algorithms like FCFS, SJF, priority scheduling, and round robin. The proposed algorithm calculates time quantum based on process burst times, shuffles processes in ascending order of burst time, and allocates CPU based on time quantum or process completion. It is claimed to provide optimum waiting time, turnaround time, response time and throughput while avoiding starvation issues of long processes. A comparison of the algorithms shows the proposed approach provides improvements over existing methods.

Uploaded by

says hello
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

An Optimum Multilevel

CPU Scheduling Algorithm


T TEAM MEMBERS
��

Mentor - Swagata Paul (SP) Sir


��

Prince Kumar Samksha Swati


CSE 3rd Year Sec B CSE 3rd Year Sec B
Roll - 18700119083 Roll - 18700319047
Ashutosh Kumar Shivam Kumar
CSE 3rd Year Sec B CSE 3rd Year Sec B
Roll - 18700119114 Roll - 18700119093
T INTRODUCTION
5
��
For the maximum and efficient utilization of the CPU, the processes should be
��
executed continuously.

CPU Scheduling plays a vital role by switching the CPU among various processes.

In Spite of availability of optimized Scheduling Algorithms, we are in need of a


new algorithm as the previous ones are not generalized.

Starvation being a matter of concern during CPU Scheduling, we proposed an


algorithm which is optimized and generalized which in turn can handle all types
of processes efficiently and compared it to previous known algorithms.
Background

What is a Processor ?
A processor (CPU) is the logic circuitry that
responds to and processes the basic
instructions that drive a computer.

Need of Scheduling ?
To allow as many process running at all the
time in order to make best use of CPU.
T
What are Schedulers ?
5
�� Schedulers are special system software which
handle process scheduling in various ways.
��

Types of Schedulers ?

Long term scheduler (Admission scheduler)

Mid term scheduler

Short term scheduler (CPU scheduler or dispatcher)


Process of Schedulers
SCHEDULING ALGORITHMS

The high efficient CPU scheduler depends on design of high quality scheduling
algorithms which suits the scheduling goals.

Popular Algorithms :

First Come Shortest Job Priority Scheduling Round Robin


First Serve (FCFS) First (SJF) Scheduling
T
FIRST COME FIRST SERVE
��
First come first serve (FCFS) scheduling algorithm simply schedules the
�� jobs according to their arrival time.

Disadvantages :

Turnaround time, waiting time and response time is high. Eg: Convoy Effect

One Process with longest burst time can monopolize CPU. Hence, throughput is low.

Lower CPU and device utilization.


First Come FIrst Serve

Average Waiting Time : 28.34

Average TurnAround Time : 45.67


T
SHORTEST JOB FIRST
��
In SJF scheduling, the process with the lowest burst time, among the list
�� of available processes in the ready queue, is going to be scheduled next.

Advantages :

Shortest jobs are favored.

Disadvantages :

SJF may cause starvation, if shorter processes keep coming.

The real difficulty with the SJF algorithm is, to know the length of the next CPU request.
Shortest Job First

Average Waiting Time : 20.17

Average TurnAround Time : 37.5


T
PRIORITY SCHEDULING
��
The O/S assigns a fixed priority rank to each process. Lower priority
�� processes get interrupted by incoming higher priority processes.

Advantages :
The relative importance of each process may be precisely defined.

Disadvantages :

If high priority processes use up a lot of CPU time, lower priority processes may starve.

Deciding which process gets which priority level.


Priority Scheduling

Average Waiting Time : 26.50

Average TurnAround Time : 43.84


T
ROUND ROBIN
��
In Round Robin Scheduling, each process ready in the ready queue run
�� turn by turn for a limited Time Quantum set by the CPU.

Advantages :
Every process gets an equal share of the CPU, so no starvation.

Disadvantages :

Performance heavily depends on time quantum.

Average Waiting time is often quite long.


Round Robin Scheduling

Average Waiting Time : 30.50

Average TurnAround Time : 47.84


T
IN USE ALGORITHMS
��

��
Multilevel feedback queue algorithm :
A multi-level feedback queue scheduling algorithm partitions the ready queue
into several separate queues. The process is allowed to move between queues.

Completely Fair Scheduling (CFS) algorithm :

It equally divides the CPU time among all the processes and priorities
each process according to there virtual runnable time.
T PROPOSED ALGORITHM
1
��

��
Calculate Time Quantum as follows:
n

∑
Where,
Quantum = Pi / n Pi = burst time of Pi,
i=1 n = number of process.

Shuffle the processes in ascending order.

If one or more process has equal burst time, allocate


CPU on basis of FCFS

If burst time < quantum, allocate the CPU till process


terminates, else CPU be occupied till time quantum.
Advantages :
CPU utilisation, waiting time, turnaround time,
response time and throughput can be optimum.

No process can monopolize CPU.

Drawbacks :

Starvation of Long Process can still occur sometimes.


Proposed Algorithm

Average Waiting Time : 23.17

Average TurnAround Time : 37.50


T
COMPARISON OF DIFFERENT ALGORITHMS
5
��
T CONCLUSION
��

CPU scheduling plays a vital role in


Switching the CPU among processes.

FUTURE SCOPE
The proposed algorithm is innovative move
and can even be implemented easily.
Improve Burst Time prediction.
It is observed that the turnaround time,
waiting time and response time of processes
Implementation and testing in
are optimum for proposed algorithm.
Open source such as LINUX.

The proposed algorithm serves all types of


job with optimum scheduling criteria.
THANK YOU

You might also like