3 search results - page 1 / 1 » Non-Clairvoyant Scheduling for Minimizing Mean Slowdown |
ALGORITHMICA
2004
13 years 4 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
SIGMETRICS
2003
ACM
13 years 9 months ago
2003
ACM
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
SIGMETRICS
2005
ACM
13 years 10 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...