Analysis of Round Robin Scheduling Algorithms in CPU Scheduling

Abstract

CPU scheduling is one of the major task under process management which is one of the most basic and indispensible function of operating system. Round Robin scheduling is a favourable choice for time sharing systems amongst all existing traditional process scheduling algorithms. In this paper, we have analysed six existing variants of traditional Round Robin algorithm and compared them to pick out which one is optimal in reducing the average of turnaround time (TAT), waiting time (WT) and number of context switches by implementing them and testing in different scenarios.

Keywords: Process scheduling, Round Robin scheduling, Context switch, Waiting time, Turnaround time, Response time