Ishwari and Deepa [8] The proposed algorithm
improves all the drawbacks of round robin C P U
scheduling algorithm. The paper also presents the
comparative analysis of proposed algorithm with
existing round robin scheduling algorithm on the
basis of varying time quantum, average waiting
time, average turnaround time and number of
context switches.