Priority based Round Robin CPU Scheduling using Dynamic Time Quantum
Deepak Lulla, Jayshri Tayade, Vilas Mankar · 2015
The main objective of this paper is to develop a new approach for round robin CPU scheduling algorithm which improves the performance of CPU. In proposed algorithm processes are scheduled for execution according to the priority by calculating the time quantum dynamically instead of using fixed time quantum. In proposed algorithm waiting time of highest priority process reduced because giving first preference to highest priority process (highest to lowest) and the number of context switches are reduced by using ‘ Dynamic Time Quantum ‘. It also looks into decreasing the average waiting time of the processes.