Round Robin CPU Scheduling Using Dynamic Time Quantum with Multiple Queue

Sonagara Payal T.

Abstract: Scheduling is the central concept used in operating system. It is help to choosing the processes for execution. There are many scheduling algorithms available in operating system like SJF, Priority, FCFS, Round Robin, multilevel queue etc. We mainly focused on Round Robin and multilevel queue scheduling algorithm. Performance of Round Robin algorithm depends upon the size of Fixed or Static Time Quantum (TQ). If TQ is very large then Round Robin algorithm approximate to First Come First Served. If Time Quantum is too small then there will be many context switching between the processes. If we use only FCFS then turnaround time is unpredictable and waiting time is large. To solve these types of problem we proposed a new algorithm as titled Round Robin CPU Scheduling using Dynamic Time Quantum with Multiple Queue.

Keywords: Scheduling, Waiting Time, Context Switch, Turnaround Time

How to Cite?: Sonagara Payal T., "Round Robin CPU Scheduling Using Dynamic Time Quantum with Multiple Queue", Volume 4 Issue 12, December 2015, International Journal of Science and Research (IJSR), Pages: 997-999, https://www.ijsr.net/getabstract.php?paperid=NOV151814, DOI: https://dx.doi.org/10.21275/NOV151814