Heavy-tailed limits for medium size jobs and comparison scheduling

Annals of Operations Research

Volumn 170, Issue 1, 2009, Pages 133-159

  Jelenković, Predrag R ^a   Kang, Xiaozhu ^a   Tan, Jian ^a  

^a Department of Earth and Environmental Sciences   (United States)

Author keywords

Adaptive thresholds; Asymptotic analysis; Comparison scheduling; Fairness; Foreground background processor sharing; Heavy tails; M G 1 queue; Medium size jobs; Processor sharing; Scalability; Shortest remaining processing time first

Indexed keywords

EID: 65049090318     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0432-0     Document Type: Conference Paper

References (32)

1. V. Anantharam 1999 Scheduling strategies and long-range dependence Queueing Systems: Theory and Applications 33 1-3 73 89
2. S. Asmussen H. Schmidli V. Schmidt 1999 Tail probabilities for non-standard risk and queueing processes with subexponential jumps Advances in Applied Probability 31 2 422 447
3. Baccelli, F., & Bremaud, P. (1994). Elements of queueing theory: Palm-Martingale calculus and stochastic recurrence. Berlin: Springer.
4. N. Bansal D. Gamarnik 2006 Handling load with less stress Queueing systems: Theory and Applications 54 1 45 54
5. Bansal, N., & Harchol-Balter, M. (2001). Analysis of SRPT scheduling: investigating unfairness. In Proceedings of ACM SIGMETRICS & Performance'01 (pp. 279-290). Cambridge, MA.
6. S. Borst O. Boxma P. Jelenković 2003 Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows Queueing Systems: Theory and Applications 43 4 273 306
7. S. C. Borst O. J. Boxma R. Núñez-Queija A. P. Zwart 2003 The impact of the service discipline on delay asymptotics Performance Evaluation 54 2 175 206
8. Caprita, B., Nieh, J., & Stein, C. (2006). Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. In PODC'06: Proceedings of the twenty-fifth annual ACM symposium on principles of distributed computing (pp. 72-81), New York, NY, USA.
9. M. Harchol-Balter B. Schroeder N. Bansal M. Agrawal 2003 Size-based scheduling to improve Web performance ACM Transactions on Computer Systems (TOCS) 21 2 207 233
10. P. R. Jelenković A. A. Lazar 1998 Subexponential asymptotics of a Markov-modulated random walk with queueing applications Journal of Applied Probability 35 2 325 347
11. Jelenković, P. R., & Momčilović, P. (2002). Resource sharing with subexponential distributions. In Proceedings of IEEE INFOCOM'02 (Vol. 3, pp. 1316-1325). New York, NY, USA.
12. P. R. Jelenković P. Momčilović 2003 Asymptotic loss probability in a finite buffer fluid queue with heterogeneous heavy-tailed on-off processes Annals of Applied Probability 13 2 576 603
13. P. R. Jelenković P. Momčilović 2003 Large deviation analysis of subexponential waiting times in a processor-sharing queue Mathematics of Operations Research 28 3 587 608
14. Jelenković, P. R., Kang, X., & Tan, J. (2007). Adaptive and scalable comparison scheduling. In Proceedings of ACM SIGMETRICS'07 (Vol. 35, No. 1, pp. 215-226). San Diego, CA, USA.
15. Kleinrock, L. (1976). Queueing systems volume II: computer applications. New York: Wiley-Interscience.
16. R. M. Loynes 1962 The stability of a queue with non-independent inter-arrival and service times Mathematical Proceedings of the Cambridge Philosophical Society 58 497 520
17. Núñez-Queija, R. (2000). Processor-sharing models for integrated-services networks. PhD thesis, Eindhoven University of Technology, the Netherlands.
18. M. Nuyens B. Zwart 2006 A large-deviations analysis of the GI/GI/1 SRPT queue Queueing Systems: Theory and Applications 54 2 85 97
19. M. Nuyens A. Wierman B. Zwart 2008 Preventing large sojourn times using SMART scheduling Operations Research 56 1 88 101
20. A. Pakes 1975 On the tails of waiting-time distributions Journal of Applied Probability 12 3 555 564
21. Z. Palmowski T. Rolski 2006 On the exact asymptotics of the busy period in GI/G/1 queues Advances in Applied Probability 38 792 803
22. Park, K., & Willinger, W. (Eds.). (2000). Self-similar network traffic and performance evaluation. New York: Wiley.
23. Rai, I. A., Urvoy-Keller, G., Vernon, M. K., & Biersack, E. W. (2004). Performance analysis of LAS-based scheduling disciplines in a packet switched network. In SIGMETRICS/Performance '04 (pp. 106-117). New York, NY, USA.
24. I. A. Rai E. W. Biersack G. Urvoy-Keller 2005 Size-based scheduling to improve the performance of short TCP flows IEEE Network 19 1 12 17
25. K. Ramanan A. L. Stolyar 2001 Largest weighted delay first scheduling: Large deviations and optimality Annals of Applied Probability 11 1 1 48
26. Rawat, M., & Kshemkalyani, A. (2003). SWIFT: Scheduling in web servers for fast response time. In Proceedings of the second IEEE international symposium on network computing and applications (p. 15). Los Alamitos, CA, USA.
27. L. E. Schrage 1968 A proof of the optimality of the shortest remaining processing time discipline Operations Research 16 3 687 690
28. L. E. Schrage L. W. Miller 1966 The queue M/G/1 with the shortest remaining processing time discipline Operations Research 14 4 670 684
29. M. S. Squillante D. D. Yao L. Zhang 1999 Web traffic modeling and Web server performance analysis ACM SIGMETRICS Performance Evaluation Review 27 3 24 27
30. Wierman, A., & Harchol-Balter, M. (2003). Classifying scheduling policies with respect to unfairness in an M/GI/1. In Proceedings of ACM SIGMETRICS'03 (pp. 238-249). San Diego, CA, USA.
31. Wolff, R. W. (1989). Stochastic modeling and theory of queues. New York: Prentice Hall.
32. A. P. Zwart O. J. Boxma 2000 Sojourn time asymptotics in the M/G/1 processor sharing queue Queueing Systems 35 1-4 141 166