Round Robin Scheduling Algorithm based on Dynamic time quantum
Rashmi Dhruv, Vivekananda School of Information Technology (VSIT), Vivekananda Institute of Professional Studies affiliated from Guru Gobind Singh Indraprastha University, Delhi India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 593-595 | Volume-8 Issue-6, August 2019. | Retrieval Number: F8070088619/2019©BEIESP | DOI: 10.35940/ijeat.F8070.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
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.
Keywords: Waiting time, Round Robin algorithm, Turn-around time, CPU Scheduling, Context Switching.