Law of large number limits of limited processor-sharing queues

Mathematics of Operations Research

Volumn 34, Issue 4, 2009, Pages 937-970

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

^a Georgia Institute of Technology   (United States)

^b CWI   (Netherlands)

Author keywords

Convolution equation; Fluid model; Invariant manifold; Limited processor sharing; Measure valued process

Indexed keywords

CONVOLUTION EQUATIONS; FLUID MODELS; INVARIANT MANIFOLDS; MEASURE-VALUED PROCESS; PROCESSOR SHARING;

COMMUNICATION SYSTEMS; COMPUTER APPLICATIONS; CONVOLUTION; FLUIDS; NONLINEAR CONTROL SYSTEMS; PLASMA FLOW; PLASMAS; QUEUEING THEORY;

MATHEMATICAL MODELS;

EID: 73249120519     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1090.0412     Document Type: Article

References (34)

1. Avi-Itzhak, B., S. Halfin. 1988. Expected response times in a non-symmetric time sharing queue with a limited number of service positions. Proc. 12th Internat. Teletraffic Congress, Torino, Italy.
2. Billingsley, P. 1995. Probability and Measure, 3rd ed. Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons Inc., New York.
3. Billingsley, P. 1999. Convergence of Probability Measures, 2nd ed. Wiley Series in Probability and Statistics: Probability and Statistics. John Wiley & Sons Inc., New York.
4. Blake, R. 1982. Optimal control of thrashing. Proc. ACM SIGMETRICS Conf. Measurements Modeling Comput. Systems, Seattle.
5. Chung, K. L. 2001. A Course in Probability Theory, 3rd ed. Academic Press Inc., San Diego.
6. Dai, J. G. 1995a. On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. 5(1) 49-77.
7. Dai, J. G. 1995b. Stability of open multiclass queueing networks via fluid models. Proc. IMA Workshop Stochastic Networks, Springer-Verlag, New York.
8. Denning, P. J., K. C. Kahn, J. Leroudier, D. Potier, R. Suri. 1976. Optimal multiprogramming. Acta Informatica 7197-216.
9. Doytchinov, B., J. Lehoczky, S. Shreve. 2001. Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11(2) 332-378.
10. Elnikety, S., E. Nahum, J. Tracy, W. Zwaenepoel. 2004. A method for transparent admission control and request scheduling in e-commerce websites. World Wide Web Conf., New York.
11. Ethier, S. N., T. G. Kurtz. 1986. Markov Processes. Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics. John Wiley & Sons Inc., New York.
12. Gromoll, H. C. 2004. Diffusion approximation for a processor sharing queue in heavy traffic. Ann. Appl. Probab. 14(2) 555-611.
13. Gromoll, H. C.,Ł Kruk. 2007. Heavy traffic limit for a processor sharing queue with soft deadlines. Ann. Appl. Probab. 17(3) 1049-1101.
14. Gromoll, H. C., A. L. Puha, R. J. Williams. 2002. The fluid limit of a heavily loaded processor sharing queue. Ann. Appl. Probab. 12(3) 797-859.
15. Gromoll, H. C., P. Robert, B. Zwart. 2008. Fluid limits for processor sharing queues with impatience. Math. Oper. Res. 33(2) 375-402.
16. Heiss, H.-U., R. Wagner. 1991. Adaptive load control in transaction processing systems. Proc. 17th Internal Conf. Large Data Bases, Barcelona, Spain.
17. Hunter, J. K., B. Nachtergaele. 2001. Applied Analysis. World Scientific Publishing Co. Inc., River Edge, NJ.
18. Jean-Marie, A., P. Robert. 1994. On the transient behavior of the processor sharing queue. Queueing Systems Theory Appl. 17(1-2) 129-136.
19. Kallenberg, O. 1986. Random Measures, 4th ed. Akademie-Verlag, Berlin.
20. Kamra, A., V. Misra, E. M. Nahum. 2004. Yaksha: A self-tuning controller for managing the performance of 3-tiered web sites. 12th IEEE Internat. Workshop Quality Service, Montreal.
21. Kaspi, H., K. Ramanan. 2007. Law of large numbers limits for many-server queues. Working paper.
22. Kleinrock, L. 1976. Queueing Systems. Vol. II, Computer Applications. Wiley-Interscience, New York.
23. Lang, S. 1983. Real Analysis, 2nd ed. Addison-Wesley Publishing Company Advanced Book Program, Reading, MA.
24. Nuyens, M., W. van der Weij. 2007. The limited processor sharing queue. Technical report, Centrum voor Wiskunde en Informatica, Amsterdam.
25. Puha, A. L., R. J. Williams. 2004. Invariant states and rates of convergence for a critical fluid model of a processor sharing queue. Ann. Appl. Probab. 14(2) 517-554.
26. Puha, A. L., A. L. Stolyar, R. J. Williams. 2006. The fluid limit of an overloaded processor sharing queue. Math. Oper. Res. 31(2) 316-350.
27. Ritchie, D. M., K. Thompson. 1974. The Unix time-sharing system. J. ACM 17(7) 365-375.
28. Schroeder, B., M. Harchol-Balter, A. Iyengar, E. Nahum, A. Wierman. 2006. How to determine a good multi-programming level for external scheduling. Proc. 22nd Internat. Conf. Data Engrg., Atlanta.
29. van der Vaart, A. W., J. A. Wellner. 1996. Weak Convergence and Empirical Processes. Springer Series in Statistics. Springer-Verlag, New York.
30. Whitt, W. 2002. Stochastic-Process Limits. Springer-Verlag, New York.
31. Zhang, F., L. Lipsky. 2006. Modelling restricted processor sharing. Proc. Internat. Conf. Parallel Distributed Processing Techniques Appl. (PDPTA06), Las Vegas, NV.
32. Zhang, F., L. Lipsky. 2007. An analytical model for computer systems with non-exponential service times and memory thrashing overhead. Proc. Internat. Conf. Parallel Distributed Processing Techniques Appl. (PDPTA07), Las Vegas, NV.
33. Zhang, J., B. Zwart. 2008. Steady state approximations of limited processor sharing queues in heavy traffic. Queueing Systems Theory Appl. 60(3-4) 227-246.
34. Zhang, J., J. G. Dai, B. Zwart. 2007. Diffusion limits of limited processor sharing queues. Technical report, Georgia Institute of Technology, Atlanta. http://www.isye.gatech.edu/∼jzhang/research/lps-ht.pdf.