Dynamic Time Quantum Computation for Improved Round Robin Scheduling Algorithm Using Quartiles and Randomization (IRRQR)

Abstract

Scheduling is a decision-making process through which large numbers of tasks compete for various system resources. The availability of limited resources makes scheduling a challenge. Among resources, the processor is the most important resource for in-time completion of tasks therefore; developing an efficient processor scheduler is still a topic of interest. In this paper, we have proposed a modified Round Robin scheduling algorithm, in which the dynamic time quantum is computed based on Quartiles and randomness. We have considered  average waiting time, average turnaround time, and the number of context switches as performance metrics and compared the proposed scheduling algorithm with existing approaches. The results show that the average waiting time, average turnaround time, and the number of context switches using the proposed algorithm are significantly  reduced as compared other algorithms.