Round Robin Scheduling Algorithm

On these slides i describe all the detail about Round Robin Scheduling Algorithm.

1. Round Robin BY: Adeel Rasheed

2. Round Robin Round robin scheduling is similar to FCFS scheduling, except that CPU bursts are assigned with limits called  time quantum . On This Example Quantum Time = 4 Process Burst Time Arrival Time P1 24 P2 3 P3 3

3. Gantt Chart Turn Around Time T.A.T=Termination Time – Arrival Time Process T.T – A.T T.A.T P1 30 – 0 30 P2 7 – 0 7 P3 10 – 0 10 Avg T.A.T = 15.66  

4. Waiting Time That’s time who process wait for start execution W.T = Turn Around Time – Burst Time Avg W.T = 5.666   Process T.A.T – B.T Waiting Time P1 30 – 24 6 P2 7 – 3 4 P3 10 – 3 7