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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1967-2018
05010015019672018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency… (More)
Is this relevant?
Review
2008
Review
2008
This paper presents a comprehensive survey on the literature considering round robin tournaments. The terminology used within the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2005
2005
We describe a hierarchical traffic shaper-scheduler, hierarchical SDRR (HSDRR), for flows of variable-length packets that is low… (More)
  • figure 1
  • table I
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2003
2003
Energy consumption is becoming a crucial issue in the design of digital systems especially when considering portable and embedded… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2003
2003
In this paper, we address the problem of fair scheduling of packets in Internet routers with input-queued switches. The goal is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
Although Ada defines a number of mechanisms for specifying scheduling policies, only one, Fifo Within Priorities is guaranteed to… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
ÐParallel systems are increasingly being used in multiuser environments with the interconnection network shared by several users… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Proportional share resource management provides a flexible and useful abstraction for multiplexing timeshared resources. However… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper studies a simple strategy, proposed independently by Gallager [1] and Katevenis [2], for fairly allocating link… (More)
  • figure 2
  • figure 3
Is this relevant?