Round-robin schedulers normally maintain a list of all runnable processes, with each process occurring exactly once in the list. But what would happen if a process occurred twice in the list?
And is round robin scheduling a preemptive or a non-preemptive scheduling strategy anyways?
In round robin scheduling, all processes in the ready queue are given equal time units. CPU time is divided equally among the processes. So if a process was listed twice, it would be granted twice the CPU time of the other processes.
Source: http://basicofcomputer.com/round_robin_scheduling_algorithm_in_operating_system.htm