The aim of this paper is to present an improved version of the round robin scheduling algorithm. Every algorithm operates in its own unique way and has its own set of advantages and disadvantages. In terms of waiting time, turnaround time, throughput, and the number of context switches, the proposed algorithm overcomes the shortcomings of existing scheduling algorithms. The algorithm is proactive and operates in accordance with the priority of the processes involved. The priority of a process is determined by the remaining burst time, with the lower the burst time, the higher the priority, and the higher the burst time, the lower the priority. A time quantum is initially defined to complete the execution. If a process's burst time is less than 2X of the specified time quantum but more than 1X of the specified time quantum, the process is given high priority and allowed to run until it completes and finishes completely. These processes don't have to wait for the next burst period to happen. The CPU consumption, throughput, and response time are not taken into account in the proposed algorithm. This algorithm is a simple improvement on the Round Robin method. The time and space complexity will be estimated in the future, and if necessary, decreased.
Author (s) DetailsMythili 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/AAER-V4/article/view/636
No comments:
Post a Comment