Skip to main content
SpringerLink
Log in

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the M t /M t /1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process are known.

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. N. Bansal and M. Harchol-Balter, Analysis of SRPT Scheduling: Investigating Unfairness, in: Proceedings of Association of Computing Machinery Sigmetrics 2001 Conference on Measurement and Modeling of Computer Systems, Cambridge, MA, (2001).

  2. T. Bonald and A. Proutière, On Performance Bounds for the Integration of Elastic and Adaptive Streaming Flows, in: Proceedings of Association of Computing Machinery Sigmetrics/Performance Joint International Conference on Measurement and Modeling of Computer Systems, (2004) 235–245.

  3. H. Chen, O. Kella, and G. Weiss, Fluid Approximations for a Processor Sharing Queue, Queueing Systems: Theory and Applications, 27 (1997) 99–125.

    Article  Google Scholar 

  4. E.G. Coffman, R.R. Muntz, and H. Trotter, Waiting Time Distribution for Processor-Sharing Systems, Journal of the Association of Computing Machinery 17 (1970) 123–130.

    Google Scholar 

  5. F. Delcoigne, A. Proutière, and G. Règniè, Modeling Integration of Streaming and Data Traffic, Performance Evaluation 55 (2004) 185–209.

    Article  Google Scholar 

  6. M. Harchol-Balter, B. Schroeder, N. Bansal, and M. Agrawal, Size-based Scheduling to Improve Web Performance, Association of Computing Machinery Transactions on Computer Systems 21(2) (2003) 207–233.

    Google Scholar 

  7. F. Guillemin and J. Boyer, Analysis of the M/M/1 Queue with Processor Sharing via Spectral Theory, Queueing Systems 39(4) (2001) 377–397.

    Article  Google Scholar 

  8. A. Jean-Marie and P. Robert, On the Transient Behavior of the Processor Sharing Queue, Queueing Systems 17 (1994) 129–136.

    Article  Google Scholar 

  9. M. Yu. Kitaev, The M/G/1 Processor-Sharing Model: Transient Behavior, Queueing Systems 14 (1993) 239–273.

    Article  Google Scholar 

  10. L. Kleinrock. Queueing Systems, Volume II: Computer Applications (John Wiley & Sons, 1976).

  11. J.D.C. Little, A Proof of the Queueing Formula L=λ W, Operations Research 9 (1961) 383–387.

    Google Scholar 

  12. A. Mandelbaum and W.A. Massey, Strong Approximations for Time Dependent Queues, Mathematics of Operations Research 20(1) (1995) 33–64.

    Google Scholar 

  13. W.A. Massey, Asymptotic Analysis of the Time Dependent M/M/1 Queue, Mathematics of Operations Research 10 (1985) 305–327.

    Article  Google Scholar 

  14. H. Masuyama and T. Takine, Sojourn Time Distribution in a MAP/M/1 Processor-Sharing Queue, Operations Research Letters 31(5) (2003) 406–412.

    Article  Google Scholar 

  15. J. Morrison, Response Time for a Processor-Sharing system, SIAM J. Appl. Math. 45(1) (1985) 152–167.

    Article  Google Scholar 

  16. R. Nunez-Queija, Processor Sharing Models for Integrated Services Networks, Ph.D. Thesis Eindhoven University of Technology (2000).

  17. T. Ott, The Sojourn Time Distribution in the M/G/1 Queue with Processor Sharing, J. Appl. Prob. 21 (1984) 360–378.

    Article  Google Scholar 

  18. J.W. Roberts, Engineering for Quality of Service, in: K. Park and W. Willinger (eds.), Self-Similar Network Traffic and Performance Evaluation (Wiley, New York, 2000) pp. 401–420.

    Google Scholar 

  19. R. Schassberger, A New Approach to the M/G/1 Processor Sharing Queue, Adv. Appl. Prob. 16 (1984) 202–213.

    Article  Google Scholar 

  20. B. Schroeder and M. Harchol-Balter, Web servers under overload: How scheduling can help, 18th International Teletraffic Congress (Berlin, Germany, 2003).

  21. B. Sengupta and D.L. Jagerman, A Conditional Response Time of the M/M/1 Processor-Sharing Queue, AT& T Technical Journal 64 (1985) 409–421.

    Google Scholar 

  22. S.F. Yashkov, A Derivation of Response Time Distribution for a M/G/1 Processor-Sharing Queue, Problems of Control and Information Theory 12(2) (1983) 133–148.

    Google Scholar 

  23. S.F. Yashkov, Processor-Sharing Queues: Some Progress in Analysis, Queueing Systems 2 (1987) 1–17.

    Article  Google Scholar 

  24. S.F. Yashkov, Mathematical Problems in the Theory of Shared-Processor Systems, Journal of Soviet Mathematics 58 (1992) 101–147.

    Article  Google Scholar 

  25. B. Zwart and O.J. Boxma, Sojourn Time Asymptotics in the M/G/1 Processor Sharing queue, Queueing Systems 35 (2000) 141–166.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ

    Robert C. Hampshire & William A. Massey

  2. School of Computer Science, Carnegie Mellon University, USA

    Mor Harchol-Balter

Authors
  1. Robert C. Hampshire
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mor Harchol-Balter
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. William A. Massey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert C. Hampshire.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hampshire, R.C., Harchol-Balter, M. & Massey, W.A. Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates. Queueing Syst 53, 19–30 (2006). https://doi.org/10.1007/s11134-006-7584-x

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-006-7584-x

Keywords

Search

Navigation