J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
We study an M/M/1 queueing system under the shortest remaining processing time (SRPT) policy. We show that the average sojourn time varies as Θ((μ(1-ρ) ln(e/(1-ρ)))-1), where ρ is the system load. Thus, SRPT offers a Θ(ln(e/(1-ρ))) factor improvement over policies that ignore knowledge of job sizes while scheduling. © 2004 Elsevier B.V. All rights reserved.
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Chai Wah Wu
Linear Algebra and Its Applications