An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum
Manish Kumar Mishra, Faizur Rashid · International Journal of Computer Science Engineering and Applications · 2014
Process management is one of the important tasks performed by the operating system.The performance of the system depends on the CPU scheduling algorithms.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 performance 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 show that the waiting time and turnaround time have been reduced in the proposed algorithm compared to traditional RR.