Improved Variable Round Robin Scheduling Algorithm

Abstract

The scheduling strategy used has an impact on system efficiency. It assigns processes in a specified order in order to improve those functions. The Round Robin method is one of several types of scheduling algorithms. In Round Robin, each process is allotted a time quantum (TQ), which indicates that each process consumes the same amount of time as the other processes. There is no precedence among the functions, and the CPU has a relatively short response time. The Time Quantum value cannot be too small because the number of context shifts will increase and hamper performance, while a Time Quantum value that is too large will harm the ART. The suggested study focuses on making the Round Robin approach more practical and efficient. © 2021 IEEE.