PRACTICAL MULTIPROCESSOR SCHEDULING ALGORITHMS FOR EFFICIENT PARALLEL PROCESSING.

Hironori Kasahara, Seinosuke Narita

    Research output: Contribution to journalArticle

    283 Citations (Scopus)

    Abstract

    Practical optimization/approximation algorithms are described for scheduling a set of partially ordered computational tasks onto a multiprocessor system so that the schedule length will be minimized. Since this problem belongs to the class of 'strong' NP-hard problems, it is not possible to construct pseudopolynomial time optimization algorithms or fully polynomial time approximation schemes unless P equals NP. A heuristic algorithm named CP/MISF (critical path/most immediate successors first) and an optimization/approximation algorithm named DF/IHS (depth-first/implicit heuristic search) are proposed. DF/IHS is an excellent scheduling method which can reduce markedly space complexity and average computation time by combining the branch-and-bound method with CP/MISF; it allows us to solve very large scale problems with a few hundred tasks. Numerical examples are included to demonstrate the effectiveness of the proposed algorithms.

    Original languageEnglish
    Pages (from-to)1023-1029
    Number of pages7
    JournalIEEE Transactions on Computers
    VolumeC-33
    Issue number11
    Publication statusPublished - 1984 Nov

    Fingerprint

    Multiprocessor Scheduling
    Parallel Processing
    Scheduling algorithms
    Scheduling Algorithm
    Optimization Algorithm
    Critical Path
    Heuristic Search
    Approximation algorithms
    Approximation Algorithms
    Processing
    Scheduling
    Branch and bound method
    Fully Polynomial Time Approximation Scheme
    Branch and Bound Method
    Space Complexity
    Multiprocessor Systems
    Large-scale Problems
    Heuristic algorithms
    NP-hard Problems
    Heuristic algorithm

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Electrical and Electronic Engineering

    Cite this

    PRACTICAL MULTIPROCESSOR SCHEDULING ALGORITHMS FOR EFFICIENT PARALLEL PROCESSING. / Kasahara, Hironori; Narita, Seinosuke.

    In: IEEE Transactions on Computers, Vol. C-33, No. 11, 11.1984, p. 1023-1029.

    Research output: Contribution to journalArticle

    @article{e52d8341c3cb476e98d2d95f5fbd8265,
    title = "PRACTICAL MULTIPROCESSOR SCHEDULING ALGORITHMS FOR EFFICIENT PARALLEL PROCESSING.",
    abstract = "Practical optimization/approximation algorithms are described for scheduling a set of partially ordered computational tasks onto a multiprocessor system so that the schedule length will be minimized. Since this problem belongs to the class of 'strong' NP-hard problems, it is not possible to construct pseudopolynomial time optimization algorithms or fully polynomial time approximation schemes unless P equals NP. A heuristic algorithm named CP/MISF (critical path/most immediate successors first) and an optimization/approximation algorithm named DF/IHS (depth-first/implicit heuristic search) are proposed. DF/IHS is an excellent scheduling method which can reduce markedly space complexity and average computation time by combining the branch-and-bound method with CP/MISF; it allows us to solve very large scale problems with a few hundred tasks. Numerical examples are included to demonstrate the effectiveness of the proposed algorithms.",
    author = "Hironori Kasahara and Seinosuke Narita",
    year = "1984",
    month = "11",
    language = "English",
    volume = "C-33",
    pages = "1023--1029",
    journal = "IEEE Transactions on Computers",
    issn = "0018-9340",
    publisher = "IEEE Computer Society",
    number = "11",

    }

    TY - JOUR

    T1 - PRACTICAL MULTIPROCESSOR SCHEDULING ALGORITHMS FOR EFFICIENT PARALLEL PROCESSING.

    AU - Kasahara, Hironori

    AU - Narita, Seinosuke

    PY - 1984/11

    Y1 - 1984/11

    N2 - Practical optimization/approximation algorithms are described for scheduling a set of partially ordered computational tasks onto a multiprocessor system so that the schedule length will be minimized. Since this problem belongs to the class of 'strong' NP-hard problems, it is not possible to construct pseudopolynomial time optimization algorithms or fully polynomial time approximation schemes unless P equals NP. A heuristic algorithm named CP/MISF (critical path/most immediate successors first) and an optimization/approximation algorithm named DF/IHS (depth-first/implicit heuristic search) are proposed. DF/IHS is an excellent scheduling method which can reduce markedly space complexity and average computation time by combining the branch-and-bound method with CP/MISF; it allows us to solve very large scale problems with a few hundred tasks. Numerical examples are included to demonstrate the effectiveness of the proposed algorithms.

    AB - Practical optimization/approximation algorithms are described for scheduling a set of partially ordered computational tasks onto a multiprocessor system so that the schedule length will be minimized. Since this problem belongs to the class of 'strong' NP-hard problems, it is not possible to construct pseudopolynomial time optimization algorithms or fully polynomial time approximation schemes unless P equals NP. A heuristic algorithm named CP/MISF (critical path/most immediate successors first) and an optimization/approximation algorithm named DF/IHS (depth-first/implicit heuristic search) are proposed. DF/IHS is an excellent scheduling method which can reduce markedly space complexity and average computation time by combining the branch-and-bound method with CP/MISF; it allows us to solve very large scale problems with a few hundred tasks. Numerical examples are included to demonstrate the effectiveness of the proposed algorithms.

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

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

    M3 - Article

    VL - C-33

    SP - 1023

    EP - 1029

    JO - IEEE Transactions on Computers

    JF - IEEE Transactions on Computers

    SN - 0018-9340

    IS - 11

    ER -