JCOM_V3_N4_RP1 Ruwanthini Siyambalapitiya Journal on Computer Science 2347–6141 3 4 1 8 Scheduling, Round Robin, Algorithms, Time Quantum, Burst Time Round Robin (RR) scheduling algorithm is a widely used scheduling algorithm in timesharing systems, as it is fair to all processes and is free of starvation. The performance of the Round Robin algorithm depends very much on the size of the time quantum selected. If the time quantum is too large, the performance of the algorithm would be similar to that of FCFS (First Come First Serve) scheduling. On the other hand, if the time quantum is too small, the number of context switches will be large. Therefore, it is necessary to have some idea about the optimum level of time quantum, so that the average waiting time and turnaround times, and the number of context switches are not too large. Several extensions to the round robin algorithm have been proposed in the literature to overcome these difficulties. In this study, the author has picked some of these extensions and tried comparing their effectiveness by means of some examples. December 2015 - February 2016 Copyright © 2016 i-manager publications. All rights reserved. i-manager Publications http://www.imanagerpublications.com/Article.aspx?ArticleId=4828