Sorted Round Robin Algorithm

Abstract

Process scheduling is an important and necessary task of a Multiprogramming operating system where the process manager handles the selection and removal of processes based on a strategy. One such strategy is the Round Robin algorithm. where each process is given a time quantum for its execution. Our algorithm is a combined product of the shortest job first (SJF) algorithm and Round Robin (RR) algorithm. It retains the advantage provided by these algorithms that may have an impact on the overall performance of the CPU and hence, is used to overcome the drawbacks in the RR algorithm by developing the strategies in use. Also, a detailed analysis is performed to compare the proposed algorithm and the existing algorithm in terms of performance and output.