Abstract

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.

References

• Rami J Matarneh. , "Self adjustment time quantum in round robin algorithm depending on burst time of the now running process", American Journal
• Mohd Abdul Ahad," Modifying round robin algorithm for process scheduling using dynamic quantum precision", International Journal of Computer applications(0975-8887) on Issues and Challenges in Networking, Intelligence and Computing Technologies- ICNICT 2012.
• Saroj Hiranwal and Dr. K. C. Roy, " Adaptive round robin scheduling using shortest burst approach based on smart time slice", International Journal of Data Engineering, volume 2, Issue. 3, 2011.
• Ali Jbaeer Dawood, " Improving efficiency of round robin scheduling using ascending quantum and minimum-maximum burst time", Journal of University of anbar for pure science : Vol. 6: No 2, 2012.
• Abbas Noon , Ali Kalakech and Saifedine Kadry, " A new round robin based scheduling algorithm for operating systems: dynamic quantum using the mean average" IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, May 2011.
• Pallab Banerjee, Probal Banerjee and Shweta Sonali Dhal, "Comparative performance analysis of mid average round robin scheduling (MARR) using dynamic time quantum with round robin scheduling algorithm having static time quatum", International Journal of Electronics and Computer Science Engineering, ISSN-2277-1956 2012.
• Debashree Nayak , Sanjeev Kumar Malla and Debashree Debadarshini, "Improved round robin scheduling using dynamic time quantum", International Journal of Computer Applications (0975-8887) Volume 38- No 5, January 2012.
• Yaashuwanth C. & R. Ramesh, " Intelligent time slice for round robin in real time operating system, IJRRAS 2 (2), February 2010.
• Braunhofer Matthias, Strumflohner Juri, " Fair round robin scheduling", September 17,2009.
• Razvan Racu, Li Li, Rafik Henia, Arne Harmann ,Rolf Ernst," Improved Response time analysis of task scheduled under preemptive round robin, CODES+ISSS '07,Proc of 5th IEEE/ACM International conference on Harware/ Software codegign and system sunthesis.
• Silberschatz, Galvin and Gagne, Operating System Concepts, 8th edition, Wiley, 2009
• J Archer Harris" Operating System", Schaum Outline.