Round-Robin is about a
preemptive scheduling: the system suspends the execution of the task in full
work if this task consumed all the its assigned time (called quantum). The suspended
process sees its PCB placed at the end of a file FIFO (First In First Out)
known as circular, and will thus pass by again once all the other processes
will have been carried out.
The PCB is the Process Control Block, containing information on those.
The problem resides in choosing the duration of the quantum. Indeed, if the quantum is too long, the computer will put too much time to answer a request of the launching type of program or an action on a program, which does not have the hand. If the quantum is too small, the commutation of context, i.e. the change of process in execution, requiring a relatively long time, will take too much of the power of the processor.
The following files present a simulation of this
algorithm: