The goal of this study is to present an improved version of the round robin scheduling technique. The Round Robin scheduling technique is one of the most extensively used CPU scheduling algorithms, and it may be found in a wide range of software applications. Every algorithm works in its own unique way and has its own set of advantages and disadvantages. In terms of waiting time, turnaround time, throughput, and the frequency of context shifts, the suggested algorithm solves the shortcomings of existing scheduling algorithms. The algorithm is proactive and works in accordance with the priority of the procedures involved. The priority of a process is determined by the remaining burst time, with the smaller the burst time, the higher the priority, and the greater the burst time, the lower the priority. A time quantum is initially set to complete the execution. If a process's burst time is less than 2X of the required time quantum but greater than 1X of the specified time quantum, the process is given high priority and permitted to run until it completes and terminates completely. These processes don't have to wait for the next burst cycle to happen.
Author(S) Details
Mythili Boopathi
SITE School, VIT University, Vellore-632014, Tamil Nadu, India.
Pranav Korde
SITE School, VIT University, Vellore-632014, Tamil Nadu, India.
Pallav Dey
SITE School, VIT University, Vellore-632014, Tamil Nadu, India.
View Book:- https://stm.bookpi.org/NPER-V5/article/view/5316
No comments:
Post a Comment