Parallel optimization algorithm for minimum execution-time multiprocessor scheduling problem

Hironori Kasahara, Atsusi Itoh, Hisamitsu Tanaka, Keisuke Itoh

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    This paper proposes a parallel optimization algorithm PDF/IHS for the minimum execution-time multiprocessor scheduling problem which is a strong NP-hard optimization problem. PDF/IHS is a parallelization and efficient implementation of the only practical optimization algorithm DF/IHS among those which have been proposed for this scheduling problem. In PDF/IHS, processors perform depth-first search in parallel on a heuristically generated search tree in such a way that it is searched hierarchically from the left- and right-hand sides. The effectiveness of PDF/IHS has been verified by simulation and practical parallel processing on Alliant FX4. As a result, it has been recognized that most of the problems which required a long time by DF/IHS can be solved approximately in time 1/m by PDF/IHS using m processors. Moreover, even for a problem which required a very long time or could not be solved in a practical time by DF/IHS, it has been verified that PDF/IHS can give solutions in time less than 1/m.

    Original languageEnglish
    Pages (from-to)54-65
    Number of pages12
    JournalSystems and Computers in Japan
    Volume23
    Issue number13
    Publication statusPublished - 1992

    Fingerprint

    Parallel Optimization
    Multiprocessor Scheduling
    Parallel Algorithms
    Execution Time
    Scheduling Problem
    Optimization Algorithm
    Scheduling
    Depth-first Search
    Search Trees
    NP-hard Problems
    Parallel Processing
    Efficient Implementation
    Parallelization
    Processing
    Optimization Problem
    Simulation

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Hardware and Architecture
    • Information Systems
    • Theoretical Computer Science

    Cite this

    Parallel optimization algorithm for minimum execution-time multiprocessor scheduling problem. / Kasahara, Hironori; Itoh, Atsusi; Tanaka, Hisamitsu; Itoh, Keisuke.

    In: Systems and Computers in Japan, Vol. 23, No. 13, 1992, p. 54-65.

    Research output: Contribution to journalArticle

    Kasahara, Hironori ; Itoh, Atsusi ; Tanaka, Hisamitsu ; Itoh, Keisuke. / Parallel optimization algorithm for minimum execution-time multiprocessor scheduling problem. In: Systems and Computers in Japan. 1992 ; Vol. 23, No. 13. pp. 54-65.
    @article{c7adbfe2ae6f4d70908d3766c5d1f9e5,
    title = "Parallel optimization algorithm for minimum execution-time multiprocessor scheduling problem",
    abstract = "This paper proposes a parallel optimization algorithm PDF/IHS for the minimum execution-time multiprocessor scheduling problem which is a strong NP-hard optimization problem. PDF/IHS is a parallelization and efficient implementation of the only practical optimization algorithm DF/IHS among those which have been proposed for this scheduling problem. In PDF/IHS, processors perform depth-first search in parallel on a heuristically generated search tree in such a way that it is searched hierarchically from the left- and right-hand sides. The effectiveness of PDF/IHS has been verified by simulation and practical parallel processing on Alliant FX4. As a result, it has been recognized that most of the problems which required a long time by DF/IHS can be solved approximately in time 1/m by PDF/IHS using m processors. Moreover, even for a problem which required a very long time or could not be solved in a practical time by DF/IHS, it has been verified that PDF/IHS can give solutions in time less than 1/m.",
    author = "Hironori Kasahara and Atsusi Itoh and Hisamitsu Tanaka and Keisuke Itoh",
    year = "1992",
    language = "English",
    volume = "23",
    pages = "54--65",
    journal = "Systems and Computers in Japan",
    issn = "0882-1666",
    publisher = "John Wiley and Sons Inc.",
    number = "13",

    }

    TY - JOUR

    T1 - Parallel optimization algorithm for minimum execution-time multiprocessor scheduling problem

    AU - Kasahara, Hironori

    AU - Itoh, Atsusi

    AU - Tanaka, Hisamitsu

    AU - Itoh, Keisuke

    PY - 1992

    Y1 - 1992

    N2 - This paper proposes a parallel optimization algorithm PDF/IHS for the minimum execution-time multiprocessor scheduling problem which is a strong NP-hard optimization problem. PDF/IHS is a parallelization and efficient implementation of the only practical optimization algorithm DF/IHS among those which have been proposed for this scheduling problem. In PDF/IHS, processors perform depth-first search in parallel on a heuristically generated search tree in such a way that it is searched hierarchically from the left- and right-hand sides. The effectiveness of PDF/IHS has been verified by simulation and practical parallel processing on Alliant FX4. As a result, it has been recognized that most of the problems which required a long time by DF/IHS can be solved approximately in time 1/m by PDF/IHS using m processors. Moreover, even for a problem which required a very long time or could not be solved in a practical time by DF/IHS, it has been verified that PDF/IHS can give solutions in time less than 1/m.

    AB - This paper proposes a parallel optimization algorithm PDF/IHS for the minimum execution-time multiprocessor scheduling problem which is a strong NP-hard optimization problem. PDF/IHS is a parallelization and efficient implementation of the only practical optimization algorithm DF/IHS among those which have been proposed for this scheduling problem. In PDF/IHS, processors perform depth-first search in parallel on a heuristically generated search tree in such a way that it is searched hierarchically from the left- and right-hand sides. The effectiveness of PDF/IHS has been verified by simulation and practical parallel processing on Alliant FX4. As a result, it has been recognized that most of the problems which required a long time by DF/IHS can be solved approximately in time 1/m by PDF/IHS using m processors. Moreover, even for a problem which required a very long time or could not be solved in a practical time by DF/IHS, it has been verified that PDF/IHS can give solutions in time less than 1/m.

    UR - http://www.scopus.com/inward/record.url?scp=0027003621&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0027003621&partnerID=8YFLogxK

    M3 - Article

    VL - 23

    SP - 54

    EP - 65

    JO - Systems and Computers in Japan

    JF - Systems and Computers in Japan

    SN - 0882-1666

    IS - 13

    ER -