IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v1y1998i4d10.1023_a1009790611712.html
   My bibliography  Save this article

On Multiprocessor System Scheduling

Author

Listed:
  • Xiaotie Deng

    (York University)

  • Patrick Dymond

    (York University)

Abstract

We show that there is a good algorithm for scheduling the average completion time of a set of unknown DAGs (i.e., data dependency relation graphs of programs) on a multiprocessor in the PRAM model (Karp and Ramachandran, 1990) (orother similar shared memory models.) Then, we show that a large class ofparallel jobs can be scheduled with near-optimal average completion time in the BSP model (Valiant, 1990a) though this is not possible for theclass of all unknown DAGs (Deng and Koutsoupias, 1993) (the same holds forother similar distributed memory models.)

Suggested Citation

  • Xiaotie Deng & Patrick Dymond, 1998. "On Multiprocessor System Scheduling," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 377-392, December.
    • Handle: RePEc:spr:jcomop:v:1:y:1998:i:4:d:10.1023_a:1009790611712
    DOI: 10.1023/A:1009790611712
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009790611712
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009790611712?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. Włodzimierz Bielecki & Krzysztof Kraska & Tomasz Klimek, 2015. "Using basis dependence distance vectors in the modified Floyd–Warshall algorithm," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 253-275, 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:jcomop:v:1:y:1998:i:4:d:10.1023_a:1009790611712. 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.