Round Robin Scheduling Algorithm

Round Robin is a CPU scheduling algorithm where each process is assigned a fixed time slot in a cyclic way. It is basically the preemptive version of First come First Serve CPU Scheduling algorithm.
Round Robin CPU Algorithm generally focuses on Time Sharing technique.
The period of time for which a process or job is allowed to run in a pre-emptive method is called time quantum.
Each process or job present in the ready queue is assigned the CPU for that time quantum, if the execution of the process is completed during that time
then the process will end else the process will go back to the waiting table and wait for its next turn to complete the execution.

- This page demonstrates the Round Robin Scheduling Algorithm using JavaScript.

- Do's and Dont's

• Do not enter special characters or symbols
• Enter required input specified
• Burst times and Time quantums must not be zero

---

Number of Processes :

Enter time quantum :

Process Information

Name	Arrival Time	Burst Time

Schedule

---

Gantt Chart

Process	Start Time	End Time

---

Results Table

Process	Arrival Time	Burst Time	Completion Time	Turnaround Time	Waiting Time
Average Waiting Time:
Average Turnaround Time: