Comparison of Various Round Robin Scheduling Algorithms

In last ten to fifteen years lots of improved and transformed forms of RR Scheduling have been created to overcome some of issues which were available in the standard RR Scheduling. When these transformed versions were given by various scientists and researchers, these algorithms were always compared with the standard Round Robin Algorithm to make sure that the improved version is better than the standard algorithm. In this research paper we tried to draw comparison between various improved versions of round robin algorithm and analyze their average waiting time, average turnaround times and context switches, to check which one improved version would be able to suggest a fruitful modification over the original one.