Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 2008 | public
Journal Article Open

Preventing Large Sojourn Times Using SMART Scheduling


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.

Additional Information

© 2008 INFORMS. Received October 2005; revisions received June 2006, September 2006; accepted October 2006. Published Online: February 1, 2008. The authors thank the referees for their suggestions and comments, which have improved the presentation and readability of the paper.

Attached Files

Accepted Version - 5469d1200cf2f5eb18051e62.pdf


Files (303.2 kB)
Name Size Download all
303.2 kB Preview Download

Additional details

August 22, 2023
August 22, 2023