Preventing large sojourn times using SMART scheduling

M.F.M. Nuyens, A. Wierman, A.P. Zwart

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

Recently, the so-called class of SMART scheduling policies has been introduced to formalize the common heuristic of "biasing toward small jobs." We study the tail of the sojourn-time (response-time) distribution under both SMART policies and the foreground-background policy (FB) in the GI/GI/1 queue. We prove that these policies behave very well under heavy-tailed service times. Specifically, we show that the sojourn-time tail under all SMART policies and FB is similar to that of the service-time tail, up to a constant, which makes the SMART class superior to first-come-first-served (FCFS). In contrast, for light-tailed service times, we prove that the sojourn-time tail under FB and SMART is larger than that under FCFS. However, we show that the sojourn-time tail for a job of size y under FB and all SMART policies still outperforms FCFS as long as y is not too large. © 2008 INFORMS.
Original languageEnglish
Pages (from-to)88-101
JournalOperations Research
Volume56
Issue number1
DOIs
Publication statusPublished - 2008

Bibliographical note

AdamBert08

Fingerprint

Dive into the research topics of 'Preventing large sojourn times using SMART scheduling'. Together they form a unique fingerprint.

Cite this