Abstract:

In this paper, we have studied various algorithms for scheduling of the processes in Operating System (OS). Amongst all the algorithms, Round Robin (RR) performs optimally in timeshared system because each process is given an equal amount of static time quantum. But the effectiveness of RR algorithm solely depends upon the choice of time quantum. We have made a comprehensive study and analysis of RR algorithm. We have proposed a new Improved-RR algorithm Intelligent RR (Intelligent Round Robin) by using Intelligent Time Slice. Our experimental analysis shows that Intelligent RR performs better than RR algorithm in terms of reducing the number of context switches, average waiting time and average turnaround time.

Keywords: Operating System, Scheduling Algorithm, Round Robin, Context switch, Waiting time, Turnaround time.