472 search results - page 2 / 95 » Quick-release Fair Scheduling |
WDAG
2007
Springer
13 years 11 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...
GLOBECOM
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--We devise an optimization framework for generalized proportional fairness (GPF) under different time scales for amplify-and-forward (AF) relay networks. In GPF scheduling...
IMSCCS
2006
IEEE
13 years 11 months 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
13 years 10 months 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
13 years 11 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...