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

    ASJC Scopus subject areas

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

    Cite this