Dynamic Time Quantum in Round Robin Algorithm (DTQRR) Depending on Burst and Arrival Time of the Processes
Dibyendu Barman

Prof. Dibyendu Barman, Assistant Professor, Department of CSE, Government College of Engineering and Textile Technology, Berhampore, Murshidabad (West Bengal), India.
Manuscript received on 12 March 2013 | Revised Manuscript received on 21 March 2013 | Manuscript Published on 30 March 2013 | PP: 60-64 | Volume-2 Issue-4, March 2013 | Retrieval Number: D0519032413/13©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© 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: In multitasking and time sharing operating system the performance of the CPU depends on waiting time, response time, turnaround time, context switches from the process mainly depends on the scheduling algorithm. Round Robin is most widely used scheduling algorithm but this algorithm has some disadvantages. Here Time Quantum play very impartment role. If the time quantum is too large then it works like FCFS (First cum First Serve) scheduling algorithm and if time quantum is too small then more context switches is occur which decrease the performance of the CPU. In this paper based on the experiments and calculations a new scheduling algorithm is introduced. In this algorithm the main idea is to adjust time quantum dynamically depending upon arrival time and burst time of the processes.
Keywords: Round Robin, Context Switch, DTQRR, CPU Scheduling.

Scope of the Article: Algorithm Engineering