Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm

In multiprogramming environment, CPU scheduling is the process to determine the most efficient way to service the requests of the processes waiting in the ready queue to be executed. The CPU scheduling algorithms focus on maximizing CPU utilization by minimizing waiting time, turnaround time and number of context switches for a set of processes. In time shared systems the preferred choice is Round Robin (RR) CPU scheduling in which performance of the system depends on the choice of the time quantum. This paper presents a dynamic time quantum based Round Robin CPU scheduling algorithm to enhance the CPU performance using the features of an Improved Round Robin (IRR) and an improved Round Robin CPU scheduling algorithm with varying time quantum (IRRVQ). The experimental and simulation results show that the proposed algorithm is proven better than the RR, IRR and IRRVQ in terms of decreasing the average waiting time, average turnaround time and number of context switches. General Terms CPU Scheduling, Operating System

[1]  Manish Kumar Mishra,et al.  AN IMPROVED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH VARYING TIME QUANTUM , 2014 .

[2]  Himansu Sekhar Behera,et al.  A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis , 2010, ArXiv.

[3]  M. Sargolzaei,et al.  THE NEW METHOD OF ADAPTIVE CPU SCHEDULING USING FONSECA AND FLEMING ’ S GENETIC ALGORITHM , 2012 .

[4]  Debashree Nayak,et al.  Improved Round Robin Scheduling using Dynamic Time Quantum , 2012 .

[5]  Manish Kumar Mishra,et al.  AN IMPROVED ROUND ROBIN CPU SCHEDULING ALGORITHM , 2012 .

[6]  Himansu Sekhar Behera,et al.  A New Dynamic Round Robin and SRTN Algorithm with Variable Original Time Slice and Intelligent Time Slice for Soft Real Time Systems , 2011, ArXiv.

[7]  Amar Ranjan Dash,et al.  An optimized round robin cpu scheduling algorithm with dynamic time quantum , 2015, ArXiv.

[8]  Himansu Sekhar Behera,et al.  Experimental Analysis of New Fair-Share Scheduling Algorithm with Weighted TimeSlice for Real Time Systems , 2011 .

[9]  Seifedine Kadry,et al.  A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average , 2011, ArXiv.

[10]  Performance M. Lavanya,et al.  Robust Quantum Based Low-power Switching Technique to improve System , 2013 .

[11]  H. S. Behera,et al.  A New Proposed Two Processor Based CPU Scheduling Algorithm with Varying Time quantum for Real Time Systems , 2011 .

[12]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[13]  Rami Matarneh,et al.  Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes , 2009 .

[14]  Tarek Helmy,et al.  Burst Round Robin as a Proportional-Share Scheduling Algorithm , 2007 .

[15]  Abdulrazaq Abdulrahim,et al.  A New Improved Round Robin (NIRR) CPU Scheduling Algorithm , 2014 .

[16]  Abdulrazaq Abdulrahim,et al.  An Additional Improvement in Round Robin (AAIRR) CPU Scheduling Algorithm , 2014 .

[17]  M. K. Srivastav,et al.  Fair Priority Round Robin with Dynamic Time Quantum : FPRRDQ , 2012 .