Refining the Round Robin Algorithm using a Recomputed Time Quantum
Neal Arden Oyam, Lester Joshua Pidlaoan, Rey Benjamin M. Baquirin, Eugene Frank Bayani, Roma Joy D. Fronda · 2020
The Round Robin CPU scheduling algorithm is a CPU scheduling algorithm that utilizes resources in an efficient manner using time a time quantum. This time quantum is used with the combination of pre-emption and first come first serve scheduling algorithm to eliminate starvation and gives a fair allocation to every process. In this paper, the proponents have come up and designed a new formula derived from common formulas used in different researches using different computations of the time quantum. Similar variables in the Round Robin CPU scheduling algorithm were used but with a more efficient approach. This derived formula for computing the time quantum was used for the Refined Round Robin scheduling algorithm. Benchmarks and comparisons in an environment with different test cases were shown to exhibit the performance differences between the proponents' formula and other known alternative formulas of the time quantum. The proponents have conducted this research in order to find out more ways to make the Round Robin CPU scheduling algorithm more efficient and effective, gaining higher CPU performance.