PRACTICAL MULTIPROCESSOR SCHEDULING ALGORITHMS FOR EFFICIENT PARALLEL PROCESSING.

Hironori Kasahara, Seinosuke Narita

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    This paper describes practical optimization/approximation algorithms for scheduling a set of partially ordered computational tasks with different processing times onto a multiprocessor system so that the schedule length is minimized. Since this problem belongs to the class of 'strong' NP hard problems, we must eliminate the possibility of constructing not only pseudopolynomial time optimization algorithms, but also fully polynomial time approximation schemes unless P equals NP. This paper proposes a heuristic algorithm CP/MISF (Critical Path/Most Immediate Successors First) and an optimization/approximation algorithm DF/IHS (Depth First/Implicit Heuristic Search). DF/IHS is an excellent scheduling method which can reduce markedly the space complexity and average computation time by combining the branch-and-bound method with CP/MISF.

    Original languageEnglish
    Pages (from-to)11-19
    Number of pages9
    JournalSystems and Computers in Japan
    Volume16
    Issue number2
    Publication statusPublished - 1985 Mar

    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
    Heuristic algorithms
    NP-hard Problems
    Heuristic algorithm
    Computational complexity

    ASJC Scopus subject areas

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

    Cite this

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

    In: Systems and Computers in Japan, Vol. 16, No. 2, 03.1985, p. 11-19.

    Research output: Contribution to journalArticle

    @article{570bcde1d62640858be0c3c6dc5eba8f,
    title = "PRACTICAL MULTIPROCESSOR SCHEDULING ALGORITHMS FOR EFFICIENT PARALLEL PROCESSING.",
    abstract = "This paper describes practical optimization/approximation algorithms for scheduling a set of partially ordered computational tasks with different processing times onto a multiprocessor system so that the schedule length is minimized. Since this problem belongs to the class of 'strong' NP hard problems, we must eliminate the possibility of constructing not only pseudopolynomial time optimization algorithms, but also fully polynomial time approximation schemes unless P equals NP. This paper proposes a heuristic algorithm CP/MISF (Critical Path/Most Immediate Successors First) and an optimization/approximation algorithm DF/IHS (Depth First/Implicit Heuristic Search). DF/IHS is an excellent scheduling method which can reduce markedly the space complexity and average computation time by combining the branch-and-bound method with CP/MISF.",
    author = "Hironori Kasahara and Seinosuke Narita",
    year = "1985",
    month = "3",
    language = "English",
    volume = "16",
    pages = "11--19",
    journal = "Systems and Computers in Japan",
    issn = "0882-1666",
    publisher = "John Wiley and Sons Inc.",
    number = "2",

    }

    TY - JOUR

    T1 - PRACTICAL MULTIPROCESSOR SCHEDULING ALGORITHMS FOR EFFICIENT PARALLEL PROCESSING.

    AU - Kasahara, Hironori

    AU - Narita, Seinosuke

    PY - 1985/3

    Y1 - 1985/3

    N2 - This paper describes practical optimization/approximation algorithms for scheduling a set of partially ordered computational tasks with different processing times onto a multiprocessor system so that the schedule length is minimized. Since this problem belongs to the class of 'strong' NP hard problems, we must eliminate the possibility of constructing not only pseudopolynomial time optimization algorithms, but also fully polynomial time approximation schemes unless P equals NP. This paper proposes a heuristic algorithm CP/MISF (Critical Path/Most Immediate Successors First) and an optimization/approximation algorithm DF/IHS (Depth First/Implicit Heuristic Search). DF/IHS is an excellent scheduling method which can reduce markedly the space complexity and average computation time by combining the branch-and-bound method with CP/MISF.

    AB - This paper describes practical optimization/approximation algorithms for scheduling a set of partially ordered computational tasks with different processing times onto a multiprocessor system so that the schedule length is minimized. Since this problem belongs to the class of 'strong' NP hard problems, we must eliminate the possibility of constructing not only pseudopolynomial time optimization algorithms, but also fully polynomial time approximation schemes unless P equals NP. This paper proposes a heuristic algorithm CP/MISF (Critical Path/Most Immediate Successors First) and an optimization/approximation algorithm DF/IHS (Depth First/Implicit Heuristic Search). DF/IHS is an excellent scheduling method which can reduce markedly the space complexity and average computation time by combining the branch-and-bound method with CP/MISF.

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

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

    M3 - Article

    VL - 16

    SP - 11

    EP - 19

    JO - Systems and Computers in Japan

    JF - Systems and Computers in Japan

    SN - 0882-1666

    IS - 2

    ER -