Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

On sojourn times in M/GI systems under state-dependent processor sharing

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider a system with Poisson arrivals and i.i.d. service times. The requests are served according to the state-dependent processor-sharing discipline, where each request receives a service capacity which depends on the actual number of requests in the system. The linear systems of PDEs describing the residual and attained sojourn times coincide for this system, which provides time reversibility including sojourn times for this system, and their minimal non-negative solution gives the LST of the sojourn time V(τ) of a request with required service time τ. For the case that the service time distribution is exponential in a neighborhood of zero, we derive a linear system of ODEs, whose minimal non-negative solution gives the LST of V(τ), and which yields linear systems of ODEs for the moments of V(τ) in the considered neighborhood of zero. Numerical results are presented for the variance of V(τ). In the case of an M/GI/2-PS system, the LST of V(τ) is given in terms of the solution of a convolution equation in the considered neighborhood of zero. For service times bounded from below, surprisingly simple expressions for the LST and variance of V(τ) in this neighborhood of zero are derived, which yield in particular the LST and variance of V(τ) in M/D/2-PS.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Bonald, T., Proutière, A.: Insensitivity in processor-sharing networks. Perform. Eval. 49, 193–209 (2002)

    Article  Google Scholar 

  2. Borst, S., Boxma, O., Jelenkovic, P.: Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows. Queueing Syst. 43, 273–306 (2003)

    Article  Google Scholar 

  3. Braband, J.: Waiting time distributions for M/M/N processor sharing queues. Commun. Stat. Stoch. Models 10, 533–548 (1994)

    Article  Google Scholar 

  4. Brandt, A., Brandt, M.: Waiting times for M/M systems under state-dependent processor sharing. Queueing Syst. 59, 297–319 (2008)

    Article  Google Scholar 

  5. Brandt, A., Brandt, M.: Insensitive bounds for the moments of the sojourn times in M/GI systems under state-dependent processor sharing. Adv. Appl. Probab. 42 (2010, to appear)

  6. Cheung, S.-K., van den Berg, H., Boucherie, R.J.: Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues. Perform. Eval. 62, 100–116 (2005)

    Article  Google Scholar 

  7. Coffman, E.G., Muntz, R.R., Trotter, H.: Waiting time distributions for processor-sharing systems. J. Assoc. Comput. Mach. 17, 123–130 (1970)

    Google Scholar 

  8. Cohen, J.W.: The multiple phase service network with generalized processor sharing. Acta Inf. 12, 245–284 (1979)

    Google Scholar 

  9. Guillemin, F., Robert, P., Zwart, B.: Tail asymptotics for processor-sharing queues. Adv. Appl. Probab. 36, 525–543 (2004)

    Article  Google Scholar 

  10. Henderson, W.: Insensitivity and reversed Markov processes. Adv. Appl. Probab. 15, 752–768 (1983)

    Article  Google Scholar 

  11. Kitaev, M.Y., Yashkov, S.F.: Distribution of the conditional sojourn time of requests in shared-processor systems. Izv. Akad. Nauk SSSR, Tekh. Kibern. 4, 211–215 (1978)

    Google Scholar 

  12. Kleinrock, L.: Time-shared systems: A theoretical treatment. J. Assoc. Comput. Mach. 14, 242–261 (1967)

    Google Scholar 

  13. Ott, T.J.: The sojourn-time distribution in the M/G/1 queue with processor sharing. J. Appl. Probab. 21, 360–378 (1984)

    Article  Google Scholar 

  14. Tolmachev, A.L.: Insensitivity in queueing networks with generalized processor-sharing discipline. In: Probability Theory and Applications, Proc. World Congr. Bernoulli Soc., Tashkent 1986, vol. 1, pp. 283–286 (1987)

  15. van den Berg, J.L., Boxma, O.J.: The M/G/1 queue with processor sharing and its relation to a feedback queue. Queueing Syst. 9, 365–401 (1991)

    Article  Google Scholar 

  16. Yashkov, S.F.: A derivation of response time distribution for an M/G/1 processor-sharing queue. Probl. Control Inf. Theory 12, 133–148 (1983)

    Google Scholar 

  17. Yashkov, S.F.: Mathematical problems in the theory of shared-processor systems. Itogi Nauki Tekh., Ser. Teor. Veroyatn. Mat. Stat., Teor. Kibern. 29, 3–82 (1990)

    Google Scholar 

  18. Yashkov, S.F., Yashkova, A.S.: Processor sharing: A survey of the mathematical theory. Autom. Remote Control 68(9), 1662–1731 (2007)

    Article  Google Scholar 

  19. Yashkova, A.S., Yashkov, S.F.: Distribution of the virtual sojourn time in the M/G/1 processor sharing queue. Inf. Process. 3(2), 128–137 (2003)

    Google Scholar 

  20. Zachary, S.: A note on insensitivity in stochastic networks. J. Appl. Probab. 44, 238–248 (2007)

    Article  Google Scholar 

  21. Zhen, Q., Knessl, C.: Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue. arXiv:0902.1199v1, pp. 1–45 (2009)

Download references

Author information

Authors and Affiliations

  1. Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB), Takustr. 7, 14195, Berlin, Germany

    Manfred Brandt

  2. Institut für Operations Research, Humboldt-Universität zu Berlin, Spandauer Str. 1, 10178, Berlin, Germany

    Andreas Brandt

Authors
  1. Manfred Brandt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Brandt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manfred Brandt.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brandt, M., Brandt, A. On sojourn times in M/GI systems under state-dependent processor sharing. Queueing Syst 64, 167–201 (2010). https://doi.org/10.1007/s11134-009-9157-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-009-9157-2

Mathematics Subject Classification (2000)

Search

Navigation