Round-Robin Scheduling
The ready queue is used in a circular fashion. The CPU is allocated to each process for a regular interval of time of 1 time quantum each new process is added to the tail ready queue. CPU scheduling picks first process from ready queue, set a timer to interrupt after 1 time quantum and then process is dispatched.If the burst time of process is less than a time quantum then it will automatically release the CPU.The average waiting time a round Robin policy is often high.
Consider the following ready queue of processes.
Process Burst time
P1 10
P2 20
P3 5
Let the time Quantum be 5 miliseconds. The Gantt chart will be as given below