IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v46y1998i1p65-72.html
   My bibliography  Save this article

The Multiprocessor Scheduling of Precedence-Constrained Task Systems in the Presence of Interprocessor Communication Delays

Author

Listed:
  • Sanjoy K. Baruah

    (The University of Vermont, Burlington, Vermont)

Abstract

The problem of scheduling precedence-constrained task systems characterized by interprocessor communication delays is addressed. It is assumed that task duplication is permitted. The target machine is a homogenous multiprocessor with an unbounded number of processors. The general problem is known to be NP-hard; however, when communication delays are small relative to task execution times, the C.P.M. based approach of Colin and Chrétienne (1991) yields an optimal schedule in polynomial time. Extensions to this method of Colin and Chrétienne are presented here, which allow for polynomial-time optimal schedule generation for certain categories of task systems with arbitrary precedence relations, processing times, and communication delays.

Suggested Citation

  • Sanjoy K. Baruah, 1998. "The Multiprocessor Scheduling of Precedence-Constrained Task Systems in the Presence of Interprocessor Communication Delays," Operations Research, INFORMS, vol. 46(1), pages 65-72, February.
    • Handle: RePEc:inm:oropre:v:46:y:1998:i:1:p:65-72
    DOI: 10.1287/opre.46.1.65
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.1.65
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.46.1.65?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
    ---><---

    References listed on IDEAS

    as
    1. J. Y. Colin & P. Chrétienne, 1991. "C.P.M. Scheduling with Small Communication Delays and Task Duplication," Operations Research, INFORMS, vol. 39(4), pages 680-684, August.
    Full references (including those not matched with items on IDEAS)

    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. Guo, Peng & Weidinger, Felix & Boysen, Nils, 2019. "Parallel machine scheduling with job synchronization to enable efficient material flows in hub terminals," Omega, Elsevier, vol. 89(C), pages 110-121.
    2. Lisa Hollermann & Tsan-sheng Hsu & Dian Rae Lopez & Keith Vertanen, 1997. "Scheduling Problems in a Practical Allocation Model," Journal of Combinatorial Optimization, Springer, vol. 1(2), pages 129-149, June.

    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:inm:oropre:v:46:y:1998:i:1:p:65-72. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.