0% found this document useful (0 votes)
30 views4 pages

CPU Scheduling Algorithmsproposal

The document proposes a micro-project on CPU scheduling algorithms. It discusses the aim, rationale and benefits of comparing algorithms like FCFS, SJF, RR using a software. It outlines the methodology, literature review, action plan and resources required for the project.

Uploaded by

Krushna Deore
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
0% found this document useful (0 votes)
30 views4 pages

CPU Scheduling Algorithmsproposal

The document proposes a micro-project on CPU scheduling algorithms. It discusses the aim, rationale and benefits of comparing algorithms like FCFS, SJF, RR using a software. It outlines the methodology, literature review, action plan and resources required for the project.

Uploaded by

Krushna Deore
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/ 4

Annexure – I B

MICRO-PROJECT PROPOSAL ON

CPU Scheduling Algorithms

SUBMITTED BY

(Name of students)

GUIDED BY

PROF. NIRAJ NAKE

DEPARTMENT OF COMPUTER ENGINEERING/TECHNOLOGY

GOVERNMENT POLYTECHNIC, AHMEDNAGAR

(2022-23)
Annexure – I B

GOVERNMENT POLYTECHNIC, AHMEDNAGAR

CERTIFICATE

(name of students)

of 3rd year Computer Engineering/Technology students have submitted


their Micro-Project Proposal on
CPU SCHEDULING ALGORITHMS

During academic session 2022- 2023 in the practical fulfilment course


for Diploma in Computer Technology.

Guide Head

Department of Computer Technology

Principal

Name of college
Annexure – I B

Micro–Project Proposal of EST

CPU Scheduling Algorithms

1.0 Aim Benefits of the micro-project:

 Solve Real World Problems Related to CPU Scheduling Algorithms


 Demonstration of CPU Scheduling Algorithms
 Comparative Study of CPU Scheduling Algorithms
 Understand how CPU scheduler works with the help of Gantt-Chart

2.0 Rationale

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 standby)
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 temporary (CPU) scheduler. The Scheduler
selects between memory processes ready to launch and assigns the CPU to one of them.

3.0 Literature Review

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
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
Annexure – I B
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 flaws.

4.0 Proposed Methodology

To develop the CPU Scheduling Algorithms Software, there we are decided the two Different
Layers-Presentation Layer and Logical Layer. In Presentation Layer to design the interface of the
software. In Logical Layer to decide and write the program for First Come First Serve (FCFS), Shortest
Job First Preemptive (SJFP), Shortest Job First Non-Preemptive(SJFNP), Round Robin(RR) and Priority
Scheduling.

5.0 Action Plan

S. No. Details of activity Planned Planned Name of Responsible


Start date Finish date Team Members
1 Group Discussion with Project Guide 01-11--2022 01-11-2022
2 Create Proposal 02-11-2022 02-11-2022
3 Implementation of CPU Scheduling 04-11-2022 14-11-2022
Algorithms in JAVA
4 Create Report 16-11-2022 18-11-2022

6.0 Resources Required

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.50 1

**************

You might also like