scholarly journals Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm

2017 ◽  
Vol 167 (13) ◽  
pp. 48-55 ◽  
Author(s):  
Yosef Berhanu ◽  
Abebe Alemu ◽  
Manish Kumar
Keyword(s):  
Scheduling Algorithm ◽  
Round Robin ◽  
Cpu Scheduling ◽  
Time Quantum ◽  
Dynamic Time

scholarly journals Round Robin Scheduling Algorithm based on Dynamic time quantum

2019 ◽  
Vol 8 (6) ◽  
pp. 593-595
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Optimal Algorithm ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Cpu Scheduling ◽  
Time Quantum ◽  
Turn Around Time ◽  
Dynamic Time ◽  
Burst Time

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.

Sign in / Sign up

Export Citation Format

Share Document