On parallelization of static scheduling algorithms

    Authors

    M. Y. Wu;W. Shu

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    IEEE Trans. Softw. Eng.

    Keywords

    static scheduling; parallel scheduling algorithm; macro dataflow graph; modified critical-path algorithm; SYSTEMS; Computer Science, Software Engineering; Engineering, Electrical &; Electronic

    Abstract

    Most static algorithms that schedule parallel programs represented by macro dataflow graphs are sequential. This paper discusses the essential issues pertaining to parallelization of static scheduling and presents two efficient parallel scheduling algorithms. The proposed algorithms have been implemented on an Inter Paragon machine and their performances have been evaluated. These algorithms produce high-quality scheduling and are much faster than existing sequential and parallel algorithms.

    Journal Title

    Ieee Transactions on Software Engineering

    Volume

    23

    Issue/Number

    8

    Publication Date

    1-1-1997

    Document Type

    Article

    Language

    English

    First Page

    517

    Last Page

    528

    WOS Identifier

    WOS:A1997XY92300004

    ISSN

    0098-5589

    Share

    COinS