Skip to main content
SpringerLink
Log in

Diffusion Limits for SRPT and LRPT Queues via EDF Approximations

  • Conference paper
  • First Online:
Queueing Theory and Network Applications (QTNA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11688))

Included in the following conference series:

Abstract

We derive a heavy traffic analysis for a G/G/1 queue in which the server uses the Shortest Remaining Processing Time (SRPT) policy from diffusion limits for G/G/1 Earliest Deadline First (EDF) systems. Our approach yields simple, concise justifications and new insights for SRPT heavy traffic limit theorems of Gromoll, Kruk and Puha [9]. Corresponding results for the longest remaining processing time (LRPT) policy are also provided.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bansal, N., Harchol-Balter, M.: Analysis of SRPT scheduling: investigating unfairness. ACM Sigmetrics Perform. Eval. Rev. 29, 279–290 (2001)

    Article  Google Scholar 

  2. Bender, M., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (1998)

    Google Scholar 

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

    Book  Google Scholar 

  4. Down, D.G., Gromoll, H.C., Puha, A.L.: Fluid limits for shortest remaining processing time queues. Math. Oper. Res. 34, 880–911 (2009)

    Article  MathSciNet  Google Scholar 

  5. Down, D.G., Wu, R.: Multi-layered round robin routing for parallel servers. Queueing Syst. 53, 177–188 (2006)

    Article  MathSciNet  Google Scholar 

  6. Doytchinov, B., Lehoczky, J.P., Shreve, S.E.: Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11, 332–378 (2001)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Gromoll, H.C., Keutel, M.: Invariance of fluid limits for the shortest remaining processing time and shortest job first policies. Queueing Syst. 70, 145–164 (2012)

    Article  MathSciNet  Google Scholar 

  9. Gromoll, H.C., Kruk, Ł., Puha, A.L.: Diffusion limits for shortest remaining processing time queues. Stoch. Syst. 1(1), 1–16 (2011)

    Article  MathSciNet  Google Scholar 

  10. Ethier, S.N., Kurtz, T.G.: Markov Processes: Characterization and Convergence. Wiley, New York (1985)

    MATH  Google Scholar 

  11. Iglehart, D., Whitt, W.: Multiple channel queues in heavy traffic I. Adv. Appl. Probab. 2, 150–177 (1970)

    Article  MathSciNet  Google Scholar 

  12. Kittsteiner, T., Moldovanu, B.: Priority auctions and queue disciplines that depend on processing time. Manage. Sci. 51, 236–248 (2005)

    Article  Google Scholar 

  13. Kruk, Ł.: Diffusion approximation for a G/G/1 EDF queue with unbounded lead times. Ann. UMCS Math. A 61, 51–90 (2007)

    MathSciNet  MATH  Google Scholar 

  14. Kruk, Ł., Sokołowska, E.: Fluid limits for multiple-input shortest remaining processing time queues. Math. Oper. Res. 41(3), 1055–1092 (2016)

    Article  MathSciNet  Google Scholar 

  15. Núñez Queija, R.: Queues with equally heavy sojourn time and service requirement distributions. Ann. Oper. Res. 113, 101–117 (2002)

    Article  MathSciNet  Google Scholar 

  16. Nuyens, M., Zwart, B.: A large deviations analysis of the GI/GI/1 SRPT queue. Queueing Syst. 54, 85–97 (2006)

    Article  MathSciNet  Google Scholar 

  17. Pavlov, A.V.: A system with Schrage servicing discipline in the case of a high load. Engrg. Cybernetics 21, 114–121 (1984). translated from Izv: Akad. Nauk SSSR Tekhn. Kibernet. 6, 59–66 (1983). (Russian)

    Google Scholar 

  18. Pechinkin, A.V.: Heavy traffic in a system with a discipline of priority servicing for the job with the shortest remaining length with interruption (Russian). Math. Issled. No. 89, Veroyatn. Anal. 97, 85–93 (1986)

    Google Scholar 

  19. Perera, R.: The variance of delay time in queueing system M/G/1 with optimal strategy SRPT. Archiv für Elektronik und Übertragungstechnik 47, 110–114 (1993)

    Google Scholar 

  20. Puha, A.L.: Diffusion limits for shortest remaining processing time queues under nonstandard spacial scaling. Ann. Appl. Probab. 25(6), 3301–3404 (2015)

    Article  MathSciNet  Google Scholar 

  21. Schassberger, R.: The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time. Adv. Appl. Probab. 22, 456–479 (1990)

    Article  MathSciNet  Google Scholar 

  22. Schrage, L.E.: A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16, 687–690 (1968)

    Google Scholar 

  23. Schrage, L.E., Miller, L.W.: The queue M/G/1 with the shortest remaining processing time discipline. Oper. Res. 14, 670–684 (1966)

    Article  MathSciNet  Google Scholar 

  24. Wierman, A., Harchol-Balter, M.: Classifying scheduling policies with respect to unfairness in an M/G/1. In: Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 238–249 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Maria Curie-Skłodowska University, Lublin, Poland

    Łukasz Kruk

Authors
  1. Łukasz Kruk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Łukasz Kruk .

Editor information

Editors and Affiliations

  1. University of Tsukuba, Tsukuba, Japan

    Tuan Phung-Duc

  2. Nara Institute of Science and Technology, Nara, Japan

    Shoji Kasahara

  3. Ghent University, Ghent, Belgium

    Sabine Wittevrongel

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kruk, Ł. (2019). Diffusion Limits for SRPT and LRPT Queues via EDF Approximations. In: Phung-Duc, T., Kasahara, S., Wittevrongel, S. (eds) Queueing Theory and Network Applications. QTNA 2019. Lecture Notes in Computer Science(), vol 11688. Springer, Cham. https://doi.org/10.1007/978-3-030-27181-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-27181-7_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-27180-0

  • Online ISBN: 978-3-030-27181-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation