A process scheduling algorithm employed by (among others) Linux. In a round robin, algorithm each process is given a set amount of time or quantum to execute. Once its quantum has expired, the process is preempted and placed onto the waiting queue. The next process on the waiting queue is then placed into the running state and executed until the quantum expires again. This algorithm is very popular in multi-user and time-sharing systems because there is a bounded amount of time a process must wait before it is executed.