Tails in scheduling
- 1 March 2007
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 34 (4) , 13-20
- https://doi.org/10.1145/1243401.1243406
Abstract
This paper gives an overview of recent research on the impact of scheduling on the tail behavior of the response time of a job. We cover preemptive and non-preemptive scheduling disciplines, consider light-tailed and heavy-tailed distributions, and discuss optimality properties. The focus is on results, intuition and insight rather than methods and techniques.Keywords
This publication has 45 references indexed in Scilit:
- SOJOURN TIMES IN THE M/G/1 FB QUEUE WITH LIGHT-TAILED SERVICE TIMESProbability in the Engineering and Informational Sciences, 2005
- Tail asymptotics for processor-sharing queuesAdvances in Applied Probability, 2004
- Moments and tails in monotone-separable stochastic networksThe Annals of Applied Probability, 2004
- Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source levelIEEE/ACM Transactions on Networking, 1997
- Waiting-time tail probabilities in queues with long-tail service-time distributionsQueueing Systems, 1994
- How large delays build up in a GI/G/1 queueQueueing Systems, 1989
- Processor-sharing queues: Some progress in analysisQueueing Systems, 1987
- On the tails of waiting-time distributionsJournal of Applied Probability, 1975
- Extreme Values in the GI/G/1 QueueThe Annals of Mathematical Statistics, 1972
- Analysis of A time‐shared processorNaval Research Logistics Quarterly, 1964