International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 69 - Number 14 |
Year of Publication: 2013 |
Authors: Sandeep Negi |
10.5120/11909-8007 |
Sandeep Negi . An Improved Round Robin Approach using Dynamic Time Quantum for Improving Average Waiting Time. International Journal of Computer Applications. 69, 14 ( May 2013), 12-16. DOI=10.5120/11909-8007
Round Robin scheduling algorithm is the most often used scheduling algorithm in timesharing systems as it is fair to all processes and is starvation free. But along with these advantages it suffers from some drawbacks such as more number of context switches, long waiting and long turnaround time. The main objective of this paper is to improve existing round robin algorithm by extending the time quantum in real time for candidate processes in such a manner that its fairness property is not lost. The proposed algorithm in this paper finds the remaining time of a process in its last turn and then based on some threshold value, decides whether its time quantum should be extended or not. A mathematical model has been developed to prove that the proposed algorithm works better than the conventional round robin algorithm. The result of experimental study also shows that the proposed improved version of round robin algorithm performs better than the conventional round robin algorithm in terms various performance metrics such as number of context switches, average waiting and turnaround time.