5 search results - page 1 / 1 » FRR: a proportional and worst-case fair round robin schedule... |
INFOCOM
2005
IEEE
14 years 4 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...
VLSID
2006
IEEE
14 years 4 months ago
2006
IEEE
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
PPOPP
2009
ACM
14 years 11 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
INFOCOM
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract— In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e. the higher the number of hops, the lower becomes the throughput...
CISS
2007
IEEE
14 years 5 months ago
2007
IEEE
— Multihop relaying in cellular networks is seen as a viable strategy to address the need for higher data rates and better coverage. In this paper, we analyze the system-level pe...