International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 98 - Number 21 |
Year of Publication: 2014 |
Authors: Aashna Bisht, Mohd Abdul Ahad, Sielvie Sharma |
10.5120/17307-7760 |
Aashna Bisht, Mohd Abdul Ahad, Sielvie Sharma . Calculating Dynamic Time Quantum for Round Robin Process Scheduling Algorithm. International Journal of Computer Applications. 98, 21 ( July 2014), 20-27. DOI=10.5120/17307-7760
Process scheduling using Round Robin Algorithm makes use of a fixed amount of time quantum that is assigned to each process to complete its execution. If the process is able to complete its execution within this time period, it is discarded from the ready queue otherwise it goes back to the rear of the ready queue and waits for its next turn. In this paper we have presented amelioration to the conventional round robin algorithm by evaluating the time quantum on the basis of the burst times of the various processes waiting in the ready queue. The allocation of dynamic time quantum to various processes will have a direct impact on various performance parameters like turnaround time, waiting time, response time and the number of context switches. Further we are increasing the time quantum for the processes which require a fractional more time to complete their execution than the allocated time quantum cycle(s).