Diffusion limits of limited processor sharing queues

Annals of Applied Probability

Volumn 21, Issue 2, 2011, Pages 745-799

  Zhang, Jiheng ^a   Dai, J G ^b   Zwart, Bert ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b Georgia Institute of Technology   (United States)

^c NONE   (Netherlands)

Author keywords

Diffusion approximation; Heavy traffic; Limited processor sharing; Measure valued process; Statespace collapse

Indexed keywords

EID: 79953290090     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/10-AAP709     Document Type: Article

References (29)

1. ASMUSSEN, S. (2003). Applied Probability and Queues: Stochastic Modelling and Applied Probability, 2nd ed. Applications of Mathematics (New York) 51. Springer, New York. MR1978607
2. AVI-ITZHAK, B. and HALFIN, S. (1988). Expected response times in a non-symmetric time sharing queue with a limited number of service positions. In Proceedings of the 12th International Teletraffic Congress. Torino.
3. BILLINGSLEY, P. (1995). Probability and Measure, 3rd ed. Wiley, New York. MR1324786
4. BILLINGSLEY, P. (1999). Convergence of Probability Measures, 2nd ed. Wiley, New York. MR1700749
5. BLAKE, R. (1982). Optimal control of thrashing. In Proceedings of the 1982 ACM SIGMETRICS Conference on Measurements and Modeling of Computer Systems. Seattle, WA.
6. BRAMSON, M. (1998). State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Syst. 30 89-148. MR1663763 (Pubitemid 128370855)
7. CARTER, M. and VAN BRUNT, B. (2000). The Lebesgue-Stieltjes Integral: A Practical Introduction. Springer, New York. MR1759133
8. DENNING, P. J., KAHN, K. C., LEROUDIER, J., POTIER, D. and SURI, R. (1976). Optimal multiprogramming. Acta Inform. 7 197-216. MR0449627
9. DOYTCHINOV, B., LEHOCZKY, J. and SHREVE, S. (2001). Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11 332-378. MR1843049
10. ELNIKETY, S., NAHUM, E., TRACY, J. and ZWAENEPOEL, W. (2004). A method for transparent admission control and request scheduling in e-commerce web sites. In World Wide Web Conference. New York.
11. ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York. MR0838085
12. GROMOLL, H. C. (2004). Diffusion approximation for a processor sharing queue in heavy traffic. Ann. Appl. Probab. 14 555-611. MR2052895
13. GROMOLL, H. C. andKRUK, Ł. (2007). Heavy traffic limit for a processor sharing queue with soft deadlines. Ann. Appl. Probab. 17 1049-1101. MR2326240
14. GROMOLL, H. C., PUHA, A. L. and WILLIAMS, R. J. (2002). The fluid limit of a heavily loaded processor sharing queue. Ann. Appl. Probab. 12 797-859. MR1925442 (Pubitemid 37023732)
15. GROMOLL, H. C., ROBERT, P. and ZWART, B. (2008). Fluid limits for processor-sharing queues with impatience. Math. Oper. Res. 33 375-402. MR2415999
16. HEISS, H. U. and WAGNER, R. (1991). Adaptive load control in transaction processing systems. In Proceedings of the 17th International Conference on Large Data Bases. Barcelona.
17. KALLENBERG, O. (1986). Random Measures, 4th ed. Akademie Verlag, Berlin. MR0854102
18. KAMRA, A., MISRA, V. and NAHUM, E. M. (2004). Yaksha: A self-tuning controller for managing the performance of 3-tiered web sites. In Twelfth IEEE International Workshop on Quality of Service.
19. KASPI, H. and RAMANAN, K. (2011). Law of large number limits for many-server queues. Ann. Appl. Probab. To appear.
20. KLEINROCK, L. (1976). Queueing Systems. Volume 2: Computer Applications. Wiley, New York.
21. NUYENS, M. and VAN DER WEIJ, W. (2007). The limited processor sharing queue. Technical report, CWI, Amsterdam.
22. PUHA, A. L. and WILLIAMS, R. J. (2004). Invariant states and rates of convergence for a critical fluid model of a processor sharing queue. Ann. Appl. Probab. 14 517-554. MR2052894 (Pubitemid 41449232)
23. RITCHIE, D. M. and THOMPSON, K. (1974). The Unix time-sharing system. J. ACM 17 365-375.
24. SCHROEDER, B., HARCHOL-BALTER, M., IYENGAR, A., NAHUM, E. and WIERMAN, A. (2006). How to determine a good multi-programming level for external scheduling. In Proceedings of the 22nd International Conference on Data Engineering. Atlanta, GA.
25. VAN DER VAART, A. W. and WELLNER, J. A. (1996). Weak Convergence and Empirical Processes: With Applications to Statistics. Springer, New York. MR1385671
26. WILLIAMS, R. J. (1998). Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Syst. 30 27-88. MR1663759 (Pubitemid 128370854)
27. ZHANG, F. and LIPSKY, L. (2006). Modelling restricted processor sharing. In Proc. of the 2006 Int'l Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA06).
28. ZHANG, F. and LIPSKY, L. (2007). An analytical model for computer systems with nonexponential service times and memory thrashing overhead. In Proc. of the 2007 Int'l Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA07).
29. ZHANG, J.,DAI, J. G. and ZWART, B. (2009). Law of large number limits of limited processorsharing queues. Math. Oper. Res. 34 937-970. MR2573503