Editing Round-robin scheduling (section)

{{Short description|Algorithm employed by process and network schedulers in computing}}
{{About|scheduling in computing|other uses|Round-robin (disambiguation)}}
{{Use American English|date=August 2022}}

[[File:Round Robin Schedule Example.jpg|thumb|350x350px|A Round Robin preemptive scheduling example with quantum=3]]

'''Round-robin''' ('''RR''') is one of the algorithms employed by [[process scheduler|process]] and [[network scheduler]]s in [[computing]].<ref name="ostep-1">{{citation|title=Operating Systems: Three Easy Pieces [Chapter: Scheduling Introduction]|url=http://pages.cs.wisc.edu/~remzi/OSTEP/cpu-sched.pdf|publisher= Arpaci-Dusseau Books|date = 2014|first1 = Remzi H.|last1 =Arpaci-Dusseau|first2=Andrea C.|last2 = Arpaci-Dusseau}}</ref><ref name=Zander>[[Guowang Miao]], Jens Zander, Ki Won Sung, and Ben Slimane, Fundamentals of Mobile Data Networks, Cambridge University Press, {{ISBN|1107143217}}, 2016.</ref>
As the term is generally used, [[Preemption (computing)#Time slice|time slices]] (also known as time quanta)<ref>{{Cite book|title=Operating Systems: Internals and Design Principles|last=Stallings|first=William|publisher=Pearson|year=2015|isbn=978-0-13-380591-8|pages=409}}</ref> are assigned to each process in equal portions and in circular order, handling all processes without [[:wikt:priority|priority]] (also known as [[cyclic executive]]). Round-robin scheduling is simple, easy to implement, and [[Resource starvation|starvation]]-free. Round-robin scheduling can be applied to other scheduling problems, such as data packet scheduling in computer networks. It is an [[operating system]] concept.

The name of the algorithm comes from the [[Round-robin (disambiguation)|round-robin]] principle known from other fields, where each person takes an equal share of something in turn.