Nearly insensitive bounds on SMART scheduling

@inproceedings{Wierman2005NearlyIB,
  title={Nearly insensitive bounds on SMART scheduling},
  author={Adam Wierman and Mor Harchol-Balter and Takayuki Osogami},
  booktitle={SIGMETRICS},
  year={2005}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…