Jump to content

Round-robin scheduling

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nixdorf (talk | contribs) at 14:36, 24 May 2003. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Round-robin scheduling is a scheduling discipline for processes in an operating system, which assigns time slices, "time quanta", to each process in equal portions and order, without any priorities between the processes. All processes will thus have the same priority.

In prioritized scheduling systems, processes on an equal priority are often adressed in a round-robin manner.

The word comes from the round-robin principle known from other fields, where each person takes equal share of something.

See also: scheduling, round-robin