M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
Paper
On the average sojourn time under M/M/1/SRPT
Abstract
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.
Related
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990