Sciweavers

Share
SIGMETRICS
2005
ACM

Nearly insensitive bounds on SMART scheduling

10 years 5 months ago
Nearly insensitive bounds on SMART scheduling
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 motivation of minimizing mean response time and/or mean slowdown. Examples of SMART policies include PSJF, SRPT, and hybrid policies such as RS (which biases according to the product of the remaining size and the original size of a job). For many policies in the SMART class, the mean response time and mean slowdown are not known or have complex representations involving multiple nested integrals, making evaluation difficult. In this work, we prove three main results. First, for all policies in the SMART class, we prove simple upper and lower bounds on mean response time. Second, we show that all policies in the SMART class, surprisingly, have very similar mean response times. Third, we show that the response times of SMART policies are largely insensitive to the variability of the job size distribution. In p...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where SIGMETRICS
Authors Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
Comments (0)
books