Conference paper
Neave effect also occurs with Tausworthe sequences
Shu Tezuka
WSC 1991
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.
Shu Tezuka
WSC 1991
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum