Skip to search formSkip to main contentSkip to account menu

Round-robin scheduling

Known as: Round robin scheduling, Round-robin, RR 
Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing.As the term is generally used, time slices are… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AmigaOSAvionics Full-Duplex Switched EthernetBackground Intelligent Transfer ServiceBluetooth

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An Efficient Approach to Calculate Dynamic Time Quantum in Round Robin Algorithm for Efficient Load Balancing
Cloud computing is one of the most emerging technologies in the world. Cloud service providers deals with huge amount of data and… 
Highly Cited
2011
Highly Cited
2011
Bandwidth and storage sharing performance in information centric networking
Internet usage has dramatically evolved towards content dissemination and retrieval, whilst the underlying infrastructure remains… 
Highly Cited
2007
Highly Cited
2007
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in… 
2005
2005
Hierarchical shaped deficit round-robin scheduling
We describe a hierarchical traffic shaper-scheduler, hierarchical SDRR (HSDRR), for flows of variable-length packets that is low… 
Highly Cited
2004
Highly Cited
2004
A Priority MAC Protocol to Support Real-Time Traffic in Ad Hoc Networks
Carrier sense multiple access and its variants have been widely used in mobile ad hoc networks. However, most existing access… 
2004
2004
Analysis of Multi-Server Round Robin scheduling disciplines
With the need and adoption of link aggregation where multiple links exist between two adjacent nodes in order to increase… 
2002
2002
Distro: a distributed static round-robin scheduling algorithm for bufferless Clos-Network switches
The Clos-network is widely recognized as a scalable architecture for high-performance switches and routers. Since more contention… 
2002
2002
Dynamic deficit round-robin scheduling scheme for variable-length packets
A dynamic deficit round-robin (DDRR) scheduling scheme for variable-length packets is proposed. It can resolve the drawback of… 
Highly Cited
1985
Highly Cited
1985
Gracefully Degradable Processor Arrays
A new approach to the design of gracefully degradable processor arrays is discussed. Fault tolerance and graceful degradation are… 
1970
1970
A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems
The queue size d i s t r ibu t ion and average wai t ing t ime for a t ime-shared sys tem using round-robin scheduling, w i th… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)