The performance of RR scheduling is sensitive
to time quantum selection, because if time quantum
is very large then RR will be the same as the FCFS
scheduling. If the time quantum is extremely too
small then RR will be the same as Processor
Sharing algorithm and number of context switches
will be very high. Each value of time quantum will
lead to a specific performance and will affect the
algorithm's efficiency by affecting the processes
waiting time, turnaround time, response time and
number of context switches.