Encyclopedia > Round-robin scheduling

  Article Content

Round-robin scheduling

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



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
242

... Contents 242 Centuries: 2nd century - 3rd century - 4th century Decades: 190s 200s 210s 220s 230s - 240s - 250s 260s 270s 280s 290s Years: 237 238 239 240 ...

 
 
 
This page was created in 25.7 ms