The Round Robin Scheduling Algorithm is designed especially for timeshare systems. A time interval called "Quantum" is defined, the duration of which varies depending on the system. The process queue is structured as a circular queue. The scheduler walks through it assigning a quantum of time to each process. The queue organization is FIFO. The Quantum is usually implemented using a timer that generates an interrupt when the Time Quantum runs out. If the process exhausts its CPU burst before finishing the Quantum, the scheduler immediately allocates the CPU to another process. This algorithm has a relatively long waiting time. However, it guarantees a distribution of the CPU between all the users and gives good response times.

Input

Process CPU Burst Arrival Time
P1
P2
P3
P4

Output

Round Robin Scheduling Process Terminal

Total Cycles

Total Time

Gantt Chart

Time Elapsed
Process