Improvising Round – Robin Process Scheduling through Dynamic Time Quantum Estimation

Abstract — Round Robin, considered as the most widely adopted CPU scheduling algorithm, undergoes severe problems directly related to quantum size. If time quantum chosen is too large, the response time of the processes is considered too high. On the other hand, if this quantum is too small, it increases the overhead of the CPU due to frequent context switches. In this paper, we propose a new algorithm based on a new approach called dynamic-time-quantum estimation intending to reduce the number of context switches among processes and offering optimal response time. The idea of this approach is to make the operating systems adjust the time quantum according to the second maximum (S_MAX) burst time of the set of waiting processes in the ready queue. A register is maintained for storing S_MAX, named as Second Max. Register (SMR). Based on the simulations and experiments, we show that the proposed algorithm solves the fixed time quantum problem and improvises the performance of Round Robin