Round robin scheduling algorithm based on dynamic time quantum

Abstract

After studying various CPU scheduling algorithms in Operating System, Round Robin scheduling algorithm is found to be most optimal algorithm in timeshared systems because of the static time quantum that is designated for every process. The efficacy of Round Robin algorithm entirely depends on the static time quantum that is being selected. After studying and analyzing Round Robin algorithm, I have proposed a new modified Round Robin algorithm that is based on shortest remaining burst time which has resulted in dynamic time quantum in place of static time quantum. This improves the performance of existing algorithm by reducing average waiting time and turn-around time and minimizing the number of context switches.