Round Robin Scheduling ( RR)

•         Each process gets a small unit of CPU time (time quantum), usually 10-100 milliseconds.  After this time has elapsed, the process is preempted and added to the end of the ready queue.

•         If there are n processes in the ready queue and the time quantum is q, then each process gets 1/n of the CPU time in chunks of at most q time units at once.  No process waits more than (n-1)q time units.

Example of RR with Time Quantum = 20

Process  Burst Time

    P1               53

   P2                17

  P3                 68

 P4                  24

The Gantt chart is: 

More RR Examples :-

Proc       Arrival        Burst

 P1              0               53

 P2             25              17

 P3             50              68

 P4             75              24

POSTED BY :-

NURUL AISYAH YAHAYA (F1072)