Round Robin

The round-robin scheduling algorithm is suitable for time-sharing computers which are similar to FCFS. However, preemption is added to this algorithm to switch between processes. A time slice is defined called time quantum which is typically 10 to 100 milliseconds. The processes are allocated CPU time up to 1-time quantum. Then the process is preempted … Read more