A Comparative Performance Analysis of Various Variants of Round Robin Scheduling Algorithm

As processor is one of the most important computer resources, it becomes obvious to use this resource in a most efficient way such that its utilization is maximum and hence waiting time, turnaround time, response time and context switch of processes submitted to it is reduced. Various scheduling algorithm are described in literature such as First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), etc. Among these RR is the most popular and widely used scheduling policy in timesharing system.

Resource Details

Research In Motion logo
Provided by:
Research In Motion