Heavy-traffic analysis of mean response time under Shortest Remaining Processing Time

Performance Evaluation

Volumn 68, Issue 10, 2011, Pages 955-966

  Lin, Minghong ^a   Wierman, Adam ^a   Zwart, Bert ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Heavy traffic; Queuing; Response time; Scheduling; Sojourn time; SRPT

Indexed keywords

ANALYSIS OF MEANS; FLOW-TIME; HEAVY TRAFFICS; HEAVY-TRAFFIC; JOB SIZE; MEAN RESPONSE TIME; QUEUE LENGTH DISTRIBUTION; QUEUING; SHORTEST REMAINING PROCESSING TIME; SOJOURN TIME; SRPT;

GROWTH RATE;

EID: 84860390002     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2011.06.001     Document Type: Article

References (35)

1. L.E. Schrage A proof of the optimality of the shortest remaining processing time discipline Operations Research 16 1968 678 690
2. L.E. Schrage, and L.W. Miller The queue M/G/1 with the shortest remaining processing time discipline Operations Research 14 1966 670 684
3. A.V. Pechinkin The MAP/G/1 queue with SRPT service discipline Theory of Probability and its Applications 45 3 2000 532 539
4. C. Goerg Evaluation of the optimal SRPT strategy with overhead IEEE Transactions on Communication 34 4 1986 338 344 (Pubitemid 16595917)
5. R. Perera The variance of delay time in queueing system M/G/1 with optimal strategy SRPT Archiv fur Elektronik und Uebertragungstechnik 47 1993 110 114 (Pubitemid 23638195)
6. F. Schreiber Properties and applications of the optimal queueing strategy SRPTa survey Archiv fur Elektronik und Uebertragungstechnik 47 1993 372 378
7. T. O'Donovan Direct solutions of M/G/1 priority queueing models Revue Francaise d'Automatique, Informatique, Recherche Operationnelle 10 1976 107 111
8. M. Harchol-Balter, B. Schroeder, M. Agrawal, and N. Bansal Size-based scheduling to improve web performance ACM Transactions on Computer Systems 21 2 2003
9. M. Rawat, A. Kshemkalyani, SWIFT: scheduling in web servers for fast response time, in: Symp. on Net. Comp. and App., 2003.
10. I.A. Rai, G. Urvoy-Keller, E. Biersack, Analysis of FB scheduling for job size distributions with high variance, in: Proc. of ACM Sigmetrics, 2003.
11. I.A. Rai, G. Urvoy-Keller, M. Vernon, E.W. Biersack, Performance modeling of FB based scheduling in packet switched networks, in: Proc. of ACM Sigmetrics-Performance, 2004.
12. M. Hu, J. Zhang, J. Sadowsky, A size-aided opportunistic scheduling scheme in wireless networks, in: Globecom, 2003.
13. M. Nuyens, and B. Zwart A large-deviations analysis of the GI/GI/1 SRPT queue Queueing System 54 2 2006 85 97 (Pubitemid 44496612)
14. M. Nuyens, A. Wierman, and B. Zwart Preventing large sojourn times using SMART scheduling Operations Research 56 1 2008 88 101 (Pubitemid 351463112)
15. O. Boxma, and B. Zwart Tails in scheduling Performance Evaluation Review 34 4 2007 13 20
16. N. Bansal, and D. Gamarnik Handling load with less stress Queueing Systems 54 1 2006 45 54 (Pubitemid 44371204)
17. N. Bansal On the average sojourn time under M/M/1/SRPT Operations Research Letters 22 2 2005 195 200
18. D.G. Down, H.C. Gromoll, and A.L. Puha Fluid limits of shortest remaining processing time queues Mathematics of Operations Research 34 2009 880 911
19. A. Wierman, M. Harchol-Balter, Classifying scheduling policies with respect to unfairness in an M/GI/1, in: Proc. of ACM Sigmetrics, 2003.
20. A. Wierman Fairness and classifications Performance Evaluation Review 34 4 2007 4 12
21. A.V. Pechinkin Heavy traffic in a system with a discipline of priority servicing for the job of shortest remaining length with interruption Matematicheskie Issledovaniya 97 1986 85 93 (89, Veroyatn. Anal.)
22. H.-L. Chen, J. Marden, A. Wierman, On the impact of heterogeneity and back-end scheduling in load balancing designs, 2009.
23. L. Andrew, M. Lin, A. Wierman, Optimality, fairness, and robustness in speed scaling designs, in: Proc. of ACM Sigmetrics, 2010.
24. W. Matuszewska On a generalization of regularly increasing functions Studia Mathematica 24 1964 271 279
25. C.M.G.N.H. Bingham, and J.L. Teugels Regular Variation 1987 Cambridge University Press
26. L. Kleinrock Queueing Systems Theory vol. I. 1975 John Wiley & Sons
27. W. Whitt Efficiency-driven heavy-traffic approximations for many-server queues with abandonments Management Science 50 10 2004 1449 1461
28. J.M. Harrison The heavy traffic approximation for single server queues in series Journal of Applied Probability 10 3 1973 613 629
29. P. Hall Heavy traffic approximations for busy period in an M G ∞ queue Stochastic Processes and their Applications 19 2 1985 259 269
30. M.F. Arlitt, and C.L. Williamson Web server workload characterization: the search for invariants SIGMETRICS'96: Proceedings of the 1996 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems 1996 ACM New York, NY, USA 126 137 (Pubitemid 126549546)
31. E. Veloso, V. Almeida, W. Meira, A. Bestavros, and S. Jin A hierarchical characterization of a live streaming media workload IMW'02: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurement 2002 ACM New York, NY, USA 117 130
32. A. Wierman, Scheduling for today's computer systems: Bridging theory and practice, Ph.D. Thesis, Carnegie Mellon University, 2007.
33. L. de Haan, S. Resnick, Positive increase and bounded increase for non-decreasing functions, Unpublished appendix to [35], 1983.
34. M. Nuyens, and A. Wierman The foregroundbackground queue: a survey Performance Evaluation 65 34 2008 286 307
35. L. de Haan, and S. Resnick Stochastic compactness and point processes Journal of the Australian Mathematical Society 37 1984 307 316