IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v101y2022i1d10.1007_s11134-021-09733-8.html
   My bibliography  Save this article

Instability of SRPT, SERPT and SJF multiclass queueing networks

Author

Listed:
  • Łukasz Kruk

    (Maria Curie- Skłodowska University)

  • Tymoteusz Chojecki

    (Maria Curie- Skłodowska University)

Abstract

We provide two examples of strictly subcritical multiclass queueing networks which are unstable under the shortest remaining processing time (SRPT) service protocol. Both of them are reentrant lines with two servers and eight customer classes. The customer service times in our first system are deterministic, yielding an example of an unstable shortest remaining expected processing time (SERPT) network. In the second one, the service times in one customer class are randomized. Both our examples show also system instability under the shortest job first (SJF) discipline. A simulation study of robustness of our results with respect to changes in the customer interarrival and service times is also provided. Our results indicate that size-based service policies may not use the available resources efficiently in a multiserver network setting and in fact cause instability effects. This is in sharp contrast with their satisfactory performance for single-server queues.

Suggested Citation

  • Łukasz Kruk & Tymoteusz Chojecki, 2022. "Instability of SRPT, SERPT and SJF multiclass queueing networks," Queueing Systems: Theory and Applications, Springer, vol. 101(1), pages 57-92, June.
    • Handle: RePEc:spr:queues:v:101:y:2022:i:1:d:10.1007_s11134-021-09733-8
    DOI: 10.1007/s11134-021-09733-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-021-09733-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-021-09733-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. G. Dai & G. Weiss, 1996. "Stability and Instability of Fluid Models for Reentrant Lines," Mathematics of Operations Research, INFORMS, vol. 21(1), pages 115-134, February.
    2. Samuli Aalto & Urtzi Ayesta, 2009. "SRPT applied to bandwidth-sharing networks," Annals of Operations Research, Springer, vol. 170(1), pages 3-19, September.
    3. Łukasz Kruk, 2018. "Stability of linear EDF networks with resource sharing," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 167-203, February.
    4. Douglas G. Down & H. Christian Gromoll & Amber L. Puha, 2009. "Fluid Limits for Shortest Remaining Processing Time Queues," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 880-911, November.
    5. Linus Schrage, 1968. "Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline," Operations Research, INFORMS, vol. 16(3), pages 687-690, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Łukasz Kruk & Robert Gieroba, 2022. "Local edge minimality of SRPT networks with shared resources," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(3), pages 459-492, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Łukasz Kruk & Robert Gieroba, 2022. "Local edge minimality of SRPT networks with shared resources," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(3), pages 459-492, December.
    2. Rouba Ibrahim, 2022. "Personalized scheduling in service systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 445-447, April.
    3. Hyytiä, Esa & Penttinen, Aleksi & Aalto, Samuli, 2012. "Size- and state-aware dispatching problem with queue-specific job sizes," European Journal of Operational Research, Elsevier, vol. 217(2), pages 357-370.
    4. Chen, Rubing & Yuan, Jinjiang & Ng, C.T. & Cheng, T.C.E., 2021. "Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion," European Journal of Operational Research, Elsevier, vol. 293(1), pages 79-92.
    5. Łukasz Kruk, 2022. "Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits," Annals of Operations Research, Springer, vol. 310(2), pages 411-429, March.
    6. Yonatan Shadmi, 2022. "Fluid limits for shortest job first with aging," Queueing Systems: Theory and Applications, Springer, vol. 101(1), pages 93-112, June.
    7. Łukasz Kruk & Ewa Sokołowska, 2016. "Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 1055-1092, August.
    8. Jing Dong & Rouba Ibrahim, 2021. "SRPT Scheduling Discipline in Many-Server Queues with Impatient Customers," Management Science, INFORMS, vol. 67(12), pages 7708-7718, December.
    9. Łukasz Kruk, 2020. "Continuity and monotonicity of solutions to a greedy maximization problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 33-76, August.
    10. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    11. Samuli Aalto, 2006. "M/G/1/MLPS compared with M/G/1/PS within service time distribution class IMRL," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 309-325, October.
    12. Mor Harchol-Balter, 2021. "Open problems in queueing theory inspired by datacenter computing," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 3-37, February.
    13. Legros, Benjamin & Jouini, Oualid & Akşin, O. Zeynep & Koole, Ger, 2020. "Front-office multitasking between service encounters and back-office tasks," European Journal of Operational Research, Elsevier, vol. 287(3), pages 946-963.
    14. Chengbin Chu, 1992. "A branch‐and‐bound algorithm to minimize total tardiness with different release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 265-283, March.
    15. Rami Atar & Anup Biswas & Haya Kaspi, 2015. "Fluid Limits of G / G /1+ G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 683-702, March.
    16. Luca Becchetti & Stefano Leonardi & Alberto Marchetti-Spaccamela & Guido Schäfer & Tjark Vredeveld, 2006. "Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 85-108, February.
    17. Hong Chen & Hanqin Zhang, 2000. "Stability of Multiclass Queueing Networks Under Priority Service Disciplines," Operations Research, INFORMS, vol. 48(1), pages 26-37, February.
    18. Koole, Ger & Pot, Auke, 2006. "Workload minimization in re-entrant lines," European Journal of Operational Research, Elsevier, vol. 174(1), pages 216-233, October.
    19. Samuli Aalto & Pasi Lassila & Prajwal Osti, 2016. "Whittle index approach to size-aware scheduling for time-varying channels with multiple states," Queueing Systems: Theory and Applications, Springer, vol. 83(3), pages 195-225, August.
    20. Nikhil Bansal & Bart Kamphorst & Bert Zwart, 2018. "Achievable Performance of Blind Policies in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 949-964, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:101:y:2022:i:1:d:10.1007_s11134-021-09733-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.