473 search results - page 6 / 95 » Early-release fair scheduling |
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Weak fairness guarantees that if an action is continuously enabled, it is executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are...
VTC
2010
IEEE
13 years 5 months ago
2010
IEEE
—This paper proposes a new wireless scheduling methodology which takes advantage of future predictions of data rate for the several users competing for physical access. Based on ...
IMSCCS
2006
IEEE
14 years 28 days ago
2006
IEEE
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather...
INFOCOM
2005
IEEE
14 years 15 days ago
2005
IEEE
In this paper, we propose an O(1) complexity round robin scheduler, called Fair Round Robin (FRR), that provides good fairness and delay properties. Unlike existing O(1) complexit...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...