A

MICROPROJECT REPORT

ON

“ CPU SHEDULING ALGORITHMS ”

SUBMITTED BY:

MORE SAMRUDDHI MAHENDRA

UNDER THE GUIDENCE OF

PROF .KHARADE.SIR

DEPARTMENT OF COMPUTER ENGINEERING

HSBPVT’sRIKRAMA POLYTECHNIC, KASHTI

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION MUMBAI

1
 DEPARTMENT OF COMPUTER ENGINEERING
HSBPVT’s PARIKRAMA POLYTECHNIC, KASHTI
MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION
MUMBAI

CERTIFICATE

This is certified that MORE SAMRUDDHI MAHENDRA , FIFTH Semester of

Diploma in Information Technology of institute HSBPVT’s Parikrama
Polytechnic, Kashti (Code:1169) has completed the micro-project satisfactorily
in course Software testing using(22518) for the academic year
2023-2024 as prescribed in the curriculum.

PLACE : KASHTI ENROLLMENT NO : 211690031

DATE : EXAM SEAT NO: 442566

SUBJECT TEACHER HEAD OF DEPARTMENT PRINCIPAL

2
 INDEX

SR.NO PAGE NO
CONTENT
01 INTRODUCTIONS

02 ACTUAL PRODUCER FOLLOWED

03 OUTPUT

04 SKILL DEVELOPED

05 DESCRIPTIONS

06 RATIONALE

07 BENEFITS OF THE PROJECTS

08 CONCLUSION

09 REFRENCES

3
 INTRODUCTION

Scheduling algorithms are mainly scheduling policies which allocate processes in such a way
that optimizes CPU efficiency. Scheduling algorithms decide which of the processes in the
ready queue is allocated to the CPU. This software explains the behavior of scheduling
algorithms against a of process loads. The user can specify the number of processes, and I/O
blocking time for each process. At the end of the result is shown. There are mainly four
scheduling algorithms First Come First Serve (FCFS), Shortest Job First Scheduling (SJF),
Round Robin Scheduling (RR), and Priority Scheduling. FCFS is a non-preemptive scheduling
that follows first in first out basic. The oldest process in the ready queue will be selected for
execution. The average waiting time for FCFS is often quite long. It suffers through Convey
effect in which a long CPU bound job may hang the CPU and may force shorter jobs to wait
longer. In SJF the process with the shortest expected processing time isselected for
execution among the processes in ready queue. It gives the minimum average time and can
be preemptive or non-preemptive. In Round robin algorithm the CPU suspends the current
job when the reserved time slice or quantum is finished. The job is then placed at the end of
the ready queue if it is not completed. If the quantum is too short, the CPU will suspend
more time on context switching and if quantum is too long, the interactive process will
suffer .So, the quantum should be chosen wisely. Priority Scheduling Algorithm, in this
priority is associated with each process. The CPU is allocated to the process with highest
priority. SJF is a special case of priority scheduling algorithm. The response time for the
highest priority process is really good but at the same time the lowest priority process may
suffer Starvation.

4
 Course outcome

Course Outcomes Integrated • Install operating system and configure it.

• Use operating system tools to perform various functions.

• Execute process commandsfor performing process management operations

. • Calculate efficiency of different memory management techniques.

• Apply scheduling algorithms to calculate turnaround time and average waiting time.

5
 Actual procedure followed:

The problem related to the project is identified and the significance of the study is
determined. The objective and also scope of study are outlined and the feasibility of the
project work is ensured to be developed within the time frame given. The solution to the
problem statement is studied and the types of system to be develop and tools used for
developing the system are also identified through literature reviews. Series of studies has
been performed to gain further knowledge CPU scheduling algorithms . Also, readings was
done to get better understanding on how algorithms works. The next phase to develop the
architecture on how the system will works. This will give the clear picture and understanding
on how the system will operate and to avoid developing a system that does not solving the
problem it intended to solve.

S. No. Name of Resource/ material

Specifications Qty Remarks
1 Computer System Windows 10 1
2 Internet Chrome 1
3 MS Word 2019 1 4 Eclipse 2022 1 5 Launch4j 3

6
OUTPUT

7
Skill Developed / learning out of this Micro-Project

• Team Work.

• Handling Information.
• Collecting Information.

• Communication Skills. 9.0 Benefits of this Micro-Project

• It works for algorithms such as FCFS, Round Robin with time quantum, Shortest Job First
and Priority Scheduling.

• It defines the process to schedule.

• It shows the Gantt-Chart of process execution.

8
• It computes average waiting time, mean response time, mean turnaround time, Idle CPU
time, and Busy CPU time.

• Easy to solve arithmetic problems related to CPU scheduling

DESCRIPTIONS

In this section, articles on CPU scheduling algorithms, are reviewed and classified according
to algorithms. In the researchers suggested comparing the three CPU algorithms based on
each algorithm's waiting time to find the most appropriate algorithm for a particular process.
They tested each algorithm individually and tested their results. In the researchers proposed
an improved version of the round-robin CPU scheduling algorithm based on the k means
clustering technique to combine the advantages of favor short process and low scheduling
overhead of round robin to reduce average waiting time, turnaround time. The k means
algorithm is used to group similar processes in clusters. The proposed algorithm was
compared with PWRR, TRR, PRR, SRR, and ADRR algorithms. The results showed that the
proposed algorithm has a better performance by minimizing time cost compared with other
algorithms. In these researchers created a fast system with fewer resources through the CPU

9
scheduling algorithm. They reduced the algorithm's runtime and efficiency constraints. They
implemented and developed algorithms FCFS, SJF, PS, RR, and DRR. Finally, they
compared these algorithms, and DRR was the best among them. In the researchers proposed
scheduling algorithms to improve the operating system's real-time performance, and the CPU
has been proposed. The proposed CPU is based on combining round scheduling (RR) and
priority-based (PB) scheduling algorithms. Experimental results showed that the new
algorithm improves all the round-robin scheduling algorithm CPU flow.

RATIONALE

Scheduling algorithms are mainly scheduling policies which allocate processes in such a way
that optimizes CPU efficiency. Scheduling algorithms decide which of the processes in the
ready queue is allocated to the CPU. This software explains the behavior of scheduling
algorithms against a of process loads. The user can specify the number of processes, and I/O
blocking time for each process. At the end of the result is shown. There are mainly four
scheduling algorithms First Come First Serve (FCFS), Shortest Job First Scheduling (SJF),
Round Robin Scheduling (RR), and Priority Scheduling. FCFS is a non-preemptive
scheduling that follows first in first out basic. The oldest process in the ready queue will be
selected for execution. The average waiting time for FCFS is often quite long. It suffers
through Convey effect in which a long CPU bound job may hang the CPU and may force
shorter jobs to wait longer. In SJF the process with the shortest expected processing time
isselected for execution among the processes in ready queue. It gives the minimum average
time and can be preemptive or non-preemptive. In Round robin algorithm the CPU suspends
the current job when the reserved time slice or quantum is finished. The job is then placed at
the end of the ready queue if it is not completed. If the quantum is too short, the CPU will
suspend more time on context switching and if quantum is too long, the interactive process

10
will suffer .So, the quantum should be chosen wisely. Priority Scheduling Algorithm, in this
priority is associated with each process. The CPU is allocated to the process with highest
priority. SJF is a special case of priority scheduling algorithm. The response time for the
highest priority process is really good but at the same time the lowest priority process may
suffer Starvation.

BENEFITS OF THE PROJECT

• It works for algorithms such as FCFS, Round Robin with time quantum, Shortest Job First
and Priority Scheduling.

• It defines the process to schedule.

• It shows the Gantt-Chart of process execution.

• It computes average waiting time, mean response time, mean turnaround time, Idle CPU
time, and Busy CPU time.

• Easy to solve arithmetic problems related to CPU scheduling.

11
 CONCLUSION

The software provides users with useful information how processes are executed in CPU.
With this, with this software it solves the real world arithmetic problems easily and accurate.
This software easy to use and convenient. With this project we learnt how processes interact
with the cp und also understood how algorithms chooses the processes from ram. Now we
able to design the programs for CPU scheduling algorithms.

12
 REFRENCES

• { HYPERLINK "https://www.javatpoint.com/os-scheduling-algorithms" }

• { HYPERLINK "https://www.geeksforgeeks.org/cpu-scheduling-in-operatingsystems/" }

• { HYPERLINK "https://stackoverflow.com/" }

13