An Enhanced Round Robin CPU Scheduling Algorithm

Abstract

CPU scheduling is a process which allows one process to use the CPU while the another process is in waiting state due to unavailability of any resource like I/O etc, thereby making full use of CPU. The aim of CPU scheduling is to make the system efficient, fast and fair. Most CPU scheduling algorithms focus on maximizing CPU utilization, maximum throughput and minimizing waiting time, turnaround time, response time and number of context switches for a set of processes. There are many algorithms available for CPU scheduling and all algorithms have their own advantages and limitations. Round Robin algorithm is designed specifically for time sharing systems. The main aim of this paper is to design a new algorithm that enhances the performance of traditional Round Robin algorithm. The proposed algorithm Enhanced Round Robin (ERR) compared with the traditional Round Robin algorithm and Improved Round Robin algorithm, produces minimal average waiting time (AWT) and average turnaround time (ATT).