CPU Scheduling Algorithm
A PROJECT REPORT
ON
“CPU scheduling algorithm”
SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS
FOR THE AWARD OF
DIPLOMA IN
Computer Engineering
SUBMITTED TO
MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION,
MUMBAI
SUBMITTED BY
Name of students: Enrollment No
1.Gadage vaishnavi G (…………..)
2.Sarode Priyanka S (…….…….)
GUIDE
Mr.Dalavi S.B
SAMARTH POLYTECHNIC,BELHE
Samarth Polytechnic ,Belhe
CPU scheduling algorithm
SAMARTH POLYTECHNIC,BELHE
CERTIFICATE
This is to Certify that the project report entitled “CPU scheduling algorithm” Was
successfully completed by Student of five semester Diploma in(computer
engineering).
.
1.Gadage vaishnavi G
2 Sarode Priyanka S
In partial fulfillment of the requirements for the award of the Diploma in
(Computer) and submitted to the Department of (Computer) Samarth Polytechnic,
Belhe work carried out during a period for the academic year 2018-19 as per
curriculum .
Mr.Dalavi S.B Prof. Pokharkar M.S. Prof. Kapile A.S.
(Subject Teacher) ( HOD ) (Principal)
Samarth Polytechnic, Belhe
CPU scheduling algorithm
Acknowledgement
This project is done as a semester project, as a part course titled “CPU scheduling We
are really thankful to our course the Principal (Prof. KAPILE A.S.) and the HOD
(Mr.POKHARKAR M.S), Computer, SAMARTH POLYTECHNIC, BELHE for his
invaluable guidance and assistance, without which the accomplishment of the task would
have never been possible We also thank (Mr Dalavi S.B)for giving this opportunity to
explore into the real world and realize the interrelation without which a Project can never
progress. I
In our present project we have chosen the topic-“CPU scheduling” We are also
thankful to parents, friend and all staff of Computer engineering department, for
providing us relevant information and necessary clarifications, and great support.
1.Gadage vaishnavi G
2.Sarode Priyanka S
Samarth Polytechnic, Belhe
CPU scheduling algorithm
Abstract
The project entitled "CPU SCHEDULING", is basically a program which
simulates the
following scheduling algorithms:
1. FCFS ( First Come First Served)
2. SJF ( Shortest Job First)
3. SRTF( Shortest Remaining Time First)
4. Priority Scheduling
5. Round‐Robin
CPU SCHEDULING is a key concept in computer multitasking, multiprocessing
operating
system and real‐time operating system designs. Scheduling refers to the way processes
are
assigned to run on the available CPUs, since there are typically many more processes
running
than there are available CPUs.
CPU scheduling deals with the problem of deciding which of the processes in the
ready
queue is to be allocated the CPU. By switching the CPU among processes, the operating
system can make the computer more productive. A multiprogramming operating system
allows more than one processes to be loaded into the executable memory at a time and
for the loaded processes to share the CPU using time‐multiplexing.
Scheduling algorithm is the method by which threads, processes or data flows are
given
access to system resources (e.g. processor time, communications bandwidth). The need
for a scheduling algorithm arises from requirement for most modern systems to perform
multitasking (execute more than one process at a time) and multiplexing (transmit
multiple flows simultaneously).
Samarth Polytechnic, Belhe
CPU scheduling algorithm
Table of contents
Chapter One : Introduction
1.1 Introduction …………………………………………………………………………..1
1.2 Motivation…………………………………………………………………………….2
1.3 Objective Of The Project …………………………………….……………………….4
Chapter 2: Theoretical Issues…………………………………………………………5
2.1 BASIC CONCEPTS………………………………………………………………..6
2.1.1 CPU‐I/O BURST CYCLE…………………………………..……………….7
2.1.2 CPU SCHEDULER…………………………………………………………9
2.1.3 PREEMPTIVE SCHEDULING…………………………………………….9
2.1.4 DISPATCHER………………………………………………………………10
2.2 SCHEDULING CRITERIA………………………………………………….10
2.3 SCHEDULING ALGORITHMS……………………………………………..12
2.3.1 FIRST-COME, FIRST- SERVED SCHEDULING……………………… .12
2.3.2 SHORTEST-JOB-FIRST SCHEDULING………………………………..14
2.3.3 PRIORITY SCHEDULING……………………………………………………....15
2.3.4 ROUND-ROBIN SCHEDULING………………………………………..16
Chapter four: Experiment results …………………………………………………...37
4.1 Results …………………………………………………………………………..38
4.2 Future Work And Recommendation ……………………………………………39
Samarth Polytechnic, Belhe
