Design of a modulus based Round Robin scheduling algorithm

CPU performance critically depends upon efficiency of the scheduling algorithm. Algorithms like Round Robin (RR) and Shortest Job First (SJF) have shortcomings in some circumstances and are dedicated to a particular scheduling scenario like Round Robin compromises on the reduction of waiting time and SJF compromises on the reduction of response time. This article proposes a new modulus based Round Robin scheduling algorithm that simultaneously offers the least compromise on the reduction of waiting time, number of context switches and response time and discusses it in detail. This article also verifies the results through numerous numerical examples. This article also provides a comparison between the proposed algorithm and the median based and average based scheduling algorithms by discussing the effect of each algorithm over the trend of waiting time, response time and number of context switches numerically and empirically.