10 search results - page 1 / 2 » Virtual-Time Round-Robin: An O(1) Proportional Share Schedul... |
USENIX
2001
13 years 6 months ago
2001
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...
VLSID
2006
IEEE
13 years 10 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...
SIAMCOMP
2010
12 years 11 months ago
2010
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
PODC
2006
ACM
13 years 10 months ago
2006
ACM
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...