A Hybrid of Round Robin and Shortest Job First CPU Scheduling Algorithm for Minimizing Average Waiting Time

Abstract

One of the important role played by CPU is process management. The CPU scheduling algorithms are essential for the performance of the system. The CPU utilization is maximized by the CPU scheduling algorithms. The algorithms used for scheduling CPU help in reducing the context-switching, turnaround time, response time ,average waiting time. First Come First Serve, Round Robin, Shortest Job First and Priority Scheduling are some useful algorithms for scheduling CPU. The systems based on time sharing uses Round Robin CPU scheduling algorithm. This paper presents an algorithm which is hybrid of both Round Robin Algorithm and Shortest Job First(SJF) Algorithm in which the burst -time of shortest job is used as the time quantum. The modified algorithm is proven useful than the conventional Round Robin. The hybrid of Round Robin and SJF algorithms have minimized the turnaround time and average waiting time to enhance CPU performance.