Abstract

Processor scheduling is one of the primary task of time sharing operating system.The main goal behind CPU scheduling algorithm is to identify the process and assign it to CPU that will give the best possible system performance. In this report,a dynamic approach is presented for Round Robin CPU scheduling. Here a modified concept of dynamic quantum for each round is designed to achieve lesser average waiting time, lesser average turnaround time and lesser number of context switching as an improved feature to conventional Round Robin scheme and also a few number of existing schemes. The comparative study of processing performance clearly shows that the proposed scheme gives approximate [15 -20]% better result than few related recent works.

References

• Raja Ram Jaiswal, K.Geetha1, R. Mohan ,“An intelligent adaptive round robin (IARR) scheduling algorithm for performance improvment in real time systems”, Proc. of Int. Conf on Advances in Mechanical Engineering ,AETAME (ELSEVIER,2013)
• Manish Kumar Mishra and Dr. Faizur Rashid,“An improved round robin cpu scheduling algorithm with varying time quantum”,International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.4, No.4, August 2014
• Abraham Silberschatz,Peter Baer Galvin,Greg Gagne,“Operating Systems Concepts”,Sixth Edition. William Stallings, “Operating Systems Internals and Design Principles”,5th Edition,Prentice Hall,(2004)
• Nayana Kundargi,Sheetal Bandekar,“Cpu scheduling algorithm using dynamic time quantum for batch system”,International Journal of Latest Trends in Engineering and Technology (IJLTET),ISSN: 2278-621X, Special Issue - IDEAS-2013
• Raman,Dr.Pardeep Kumar Mittal,“An Efficient Dynamic Round Robin CPU Scheduling Algorithm”,International Journal of Advanced Research in Computer Science and Software Engineering,ISSN: 2277 128X,Volume 4, Issue 5, May 2014
• Lipika Datta,“Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice”,I.J. Education and Management Engineering, 2015, 2, 10-19
• Vishnu Kumar Dhakad, Lokesh Sharma,“Performance analysis of round robin scheduling using adaptive approach based on smart time slice and comparison with SRR”, International Journal of Advances in Engineering & Technology,ISSN: 2231-1963,Vol. 3, Issue 2, pp. 333-339, May 2012.
• Abbas Noon, Ali Kalakech, Seifedine Kadry,“A New Round Robin Based Scheduling Algorithm for Operating ystems: Dynamic Quantum Using the Mean Average”,IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, May 2011 ISSN (Online): 1694-0814
• Saroj Hiranwal, Dr. K.C. Roy,“Adaptive Round Robin Scheduling using Shortest Burst Approach Based on Smart Time Slice”,International Journal of Computer Science and Communication Vol. 2, No. 2, July-December 2011, pp. 319-323
• Pallab Banerjee, Probal Banerjee, Shweta Sonali Dhal,“Comparative Performance Analysis of Average Max Round Robin Scheduling Algorithm (AMRR) using Dynamic Time Quantum with Round Robin Scheduling Algorithm using static Time Quantum”,International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-1, Issue-3, August 2012