IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v160y2008i1p227-25510.1007-s10479-008-0312-7.html
   My bibliography  Save this article

Generalized parallel-server fork-join queues with dynamic task scheduling

Author

Listed:
  • Mark Squillante
  • Yanyong Zhang
  • Anand Sivasubramaniam
  • Natarajan Gautam

Abstract

This paper introduces a generalization of the classical parallel-server fork-join queueing system in which arriving customers fork into multiple tasks, every task is uniquely assigned to one of the set of single-server queues, and each task consists of multiple iterations of different stages of execution, including task vacations and communication among sibling tasks. Several classes of dynamic polices are considered for scheduling multiple tasks at each of the single-server queues to maintain effective server utilization. The paper presents an exact matrix-analytic analysis of generalized parallel-server fork-join queueing systems, for small instances of the stochastic model, and presents an approximate matrix-analytic analysis and fixed-point solution, for larger instances of the model. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Mark Squillante & Yanyong Zhang & Anand Sivasubramaniam & Natarajan Gautam, 2008. "Generalized parallel-server fork-join queues with dynamic task scheduling," Annals of Operations Research, Springer, vol. 160(1), pages 227-255, April.
    • Handle: RePEc:spr:annopr:v:160:y:2008:i:1:p:227-255:10.1007/s10479-008-0312-7
    DOI: 10.1007/s10479-008-0312-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-008-0312-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-008-0312-7?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.

    Citations

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


    Cited by:

    1. Hongyuan Lu & Guodong Pang, 2016. "Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 560-595, May.

    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:annopr:v:160:y:2008:i:1:p:227-255:10.1007/s10479-008-0312-7. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.