Skip to main content
SpringerLink
Log in

Steady state approximations of limited processor sharing queues in heavy traffic

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We investigate steady state properties of limited processor sharing queues in heavy traffic. Our analysis builds on previously obtained process limit theorems, and requires the interchange of steady state and heavy traffic limits, which are established by a coupling argument. The limit theorems yield explicit approximations of the steady state queue length and response time distribution in heavy traffic, of which the quality is supported by simulation experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Asmussen, S.: Applied Probability and Queues, 2nd edn. Applications of Mathematics (New York), vol. 51. Springer, New York (2003)

    Google Scholar 

  2. Avi-Itzhak, B., Halfin, S.: 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 (1988)

  3. Billingsley, P.: Convergence of Probability Measures, 2nd edn. Wiley Series in Probability and Statistics: Probability and Statistics. Wiley, New York (1999)

    Google Scholar 

  4. Blake, R.: Optimal control of thrashing. In: Proceedings of the 1982 ACM SIGMETRICS Conference on Measurements and Modeling of Computer Systems. Seattle, WA (1982)

  5. Budhiraja, A., Lee, C.: Stationary distribution convergence for generalized Jackson networks in heavy traffic. Technical Report, University of North Carolina at Chapel Hill (2008). http://www.unc.edu/%7Echlee/jackson.pdf

  6. Denning, P.J., Kahn, K.C., Leroudier, J., Potier, D., Suri, R.: Optimal multiprogramming. Acta Inform. 7, 197–216 (1976)

    Article  Google Scholar 

  7. Elnikety, S., Nahum, E., Tracy, J., Zwaenepoel, W.: A method for transparent admission control and request scheduling in e-commerce web sites. In: World-Wide-Web Conference (2004)

  8. Gamarnik, D., Zeevi, A.: Validity of heavy traffic steady-state approximation in generalized Jackson networks. Ann. Appl. Probab. 16(1), 56–90 (2006)

    Article  Google Scholar 

  9. Grishechkin, S.: GI/G/1 processor sharing queue in heavy traffic. Adv. Appl. Probab. 26(2), 539–555 (1994)

    Article  Google Scholar 

  10. Gromoll, H.C.: Diffusion approximation for a processor sharing queue in heavy traffic. Ann. Appl. Probab. 14(2), 555–611 (2004)

    Article  Google Scholar 

  11. Gromoll, H.C., Kruk, Ł.: Heavy traffic limit for a processor sharing queue with soft deadlines. Ann. Appl. Probab. 17(3), 1049–1101 (2007)

    Article  Google Scholar 

  12. Gromoll, H.C., Puha, A.L., Williams, R.J.: The fluid limit of a heavily loaded processor sharing queue. Ann. Appl. Probab. 12(3), 797–859 (2002)

    Article  Google Scholar 

  13. Gromoll, H.C., Robert, P., Zwart, B.: Fluid limits for processor sharing queues with impatience. Math. Oper. Res. 33(2), 375–402 (2008)

    Article  Google Scholar 

  14. Gupta, V., Dai, J.G., Harchol-Balter, M., Zwart, B.: On the inapproximability of M/G/K: Why two moments of job size distribution are not enough. Technical report, Carnegie Mellon University (2007)

  15. Heiss, H.-U., Wagner, R.: Adaptive load control in transaction processing systems. In: Proceedings of the 17th International Conference on Large Data Bases (1991)

  16. Kamra, A., Misra, V., Nahum, E.M.: Yaksha: A self-tuning controller for managing the performance of 3-tiered web sites. In: Twelfth IEEE International Workshop on Quality of Service (2004)

  17. Kleinrock, L.: Queueing Systems. Computer Applications, vol. II. Wiley, New York (1976)

    Google Scholar 

  18. Maulik, K., Zwart, B.: An extension of the square root law of TCP. Ann. Oper. Res. (2008, to appear)

  19. Nuyens, M., van der Weij, W.: The limited processor sharing queue. Technical report, CWI, Amsterdam (2007)

  20. Ritchie, D.M., Thompson, K.: The Unix time-sharing system. J. Assoc. Comput. Mach. 17(7), 365–375 (1974)

    Google Scholar 

  21. Schroeder, B., Harchol-Balter, M., Iyengar, A., Nahum, E., Wierman, A.: How to determine a good multi-programming level for external scheduling. In: Proceedings of the 22nd International Conference on Data Engineering. Atlanta, GA (2006)

  22. Sigman, K., Wolff, R.W.: A review of regenerative processes. SIAM Rev. 35(2), 269–288 (1993)

    Article  Google Scholar 

  23. Zhang, F., Lipsky, L.: Modelling restricted processor sharing. In: Proc. of the 2006 Int’l Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA06) (2006)

  24. Zhang, F., Lipsky, L.: An analytical model for computer systems with non-exponential service times and memory thrashing overhead. In: Proc. of the 2007 Int’l Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA07) (2007)

  25. Zhang, J., Dai, J.G., Zwart, B.: Diffusion limits of limited processor sharing queues. Technical report, Georgia Institute of Technology (2007). http://www.isye.gatech.edu/~jzhang/research/lps-ht.pdf

  26. Zhang, J., Dai, J.G., Zwart, B.: Law of large number limits of limited processor sharing queues. Technical report, Georgia Institute of Technology (2007). http://www.isye.gatech.edu/~jzhang/research/fl-lps.pdf

Download references

Author information

Authors and Affiliations

  1. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA

    Jiheng Zhang & Bert Zwart

Authors
  1. Jiheng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bert Zwart
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiheng Zhang.

Additional information

This research is supported in part by National Science Foundation grant CNS-0718701.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, J., Zwart, B. Steady state approximations of limited processor sharing queues in heavy traffic. Queueing Syst 60, 227–246 (2008). https://doi.org/10.1007/s11134-008-9095-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-008-9095-4

Keywords

Mathematics Subject Classification (2000)

Search

Navigation