Abstract
We study how the average performance of a system degrades as the load nears its peak capacity. We restrict our attention to the performance measures of average sojourn time and the large deviation rates of buffer overflow probabilities. We first show that for certain queueing systems, the average sojourn time of requests depends much more weakly on the load ρ than the commonly observed 1/(1−ρ) dependence for most queueing policies. For example, we show that for an M/G/1 system under the preemptive Shortest Job First (pSJF) policy, the average sojourn time varies as log (1/(1−ρ)) with load for a certain class of distributions.
We observe that such results hold even for more restricted policies. We give some examples of non-preemptive policies and policies that do not use the knowledge of job sizes while scheduling, where the dependence of average sojourn time on load is significantly better than 1/(1−ρ). Similar results hold even for very simple non-preemptive threshold based policies that partition all the jobs into two job classes based on a fixed threshold and do FIFO within each class. Finally we study the large deviations rate of the queue length under a simple dedicated partition-based policy.
Similar content being viewed by others
References
N. Bansal, On the average sojourn time under M/M/1/SRPT, Operations Research Letters 33(2005) 195–200.
D. Bertsimas, I. Paschalidis, and J. Tsitsiklis, Large deviations behavior of acyclic networks of G/G/1 queues, The Annals of Applied Probability 8(1998) 1027–1069.
R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of scheduling, Addison-Wesley Publishing Company, 1967.
H. Feng and V. Misra, Mixed scheduling disciplines for network flows (the optimality of FBPS), Proceedings of The Fifth Workshop on MAthematical performance Modeling and Analysis (MAMA), 2003.
M. Harchol-Balter, Task assignment with unknown duration, Journal of the ACM (JACM) 49(2002) 260–288.
L. Kleinrock, Queueing systems, John Wiley and Sons, 1975.
L. Kleinrock, Queueing systems vol. 2: Computer applications, John Wiley and Sons, 1976.
T.M. O'Donovan, Distribution of attained service and residual service in general queueing systems, Operations Research 22(1974) 570–575.
R. Righter and J.G. Shanthikumar, Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures, Probability in the Engineering and Informational Sciences 3(1989) 323–333.
L.E. Schrage, A proof of the optimality of the shortest remaining processing time discipline, Operations Research 16(1968) 678–690.
D. Stoyan, Comparison methods for queues and other stochastic models, Wiley, 1983.
A. Wierman, M. Harchol-Balter, and T. Osogami, Nearly insensitive bounds on SMART scheduling, ACM Sigmetrics, (2005) 205–216.
R. W. Wolff, Stochastic modeling and the theory of queues, Prentice Hall, 1989.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bansal, N., Gamarnik, D. Handling load with less stress. Queueing Syst 54, 45–54 (2006). https://doi.org/10.1007/s11134-006-8218-z
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11134-006-8218-z