AN IMPROVED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH VARYING TIME QUANTUM

Process management is one of the important tasks performed by the operating system. The performance of the system depends on theCPU schedulingalgorithms. The main aim of the CPU scheduling algorithms is to minimize waiting time, turnaround time, response time and context switching and maximizing CPU utilization. First-Come-First-Served (FCFS) Round Robin (RR), Shortest Job First (SJF) and, Priority Scheduling are some popular CPU scheduling algorithms . In time shared systems, Round Robin CPU scheduling is the preferred choice. In Round Robin CPU scheduling,performance of the system depends on the choice of the optimal time quantum. This paper presents an improved Round Robin CPU scheduling algorithm coined enhancing CPU per formance using the features of Shortest Job First and Round Robin scheduling with varying time quantum. The proposed algorithm is experimentally proven better than conventional RR.The simulation results showthat the waiting time and turnaround time havebeen reduced in the proposed algorithm compared to traditional RR.

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

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

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

[4]  Himansu Sekhar Behera,et al.  A Clustering Based CPU Scheduling Algorithm for Real Time Systems , 2011 .

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

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

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

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

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

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

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

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

[13]  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.

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

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