APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS.

Hironori Kasahara, Seinosuke Narita

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Citations (Scopus)

    Abstract

    The multiprocessor scheduling problem has so far been regarded as impractical because the problem itself is NP-hard in the strong sense, therefore too difficult to solve, and involves several assumptions which do not appear to be applicable to actual parallel processing systems. The authors present two powerful and practical static scheduling algorithms named DF/IHS and CP/MISF and demonstrate their practicality by application to the parallel processing of continuous systems simulation and robot arm control computation on an actual multiprocessor system. A discussion is also presented of how the static scheduling algorithms are incorporated for efficient parallel processing on multiprocessor supercomputing systems. The authors show that the combined use of static and dynamic scheduling will be a powerful approach for the development of future supercomputing systems.

    Original languageEnglish
    Title of host publicationUnknown Host Publication Title
    Place of PublicationNew York, NY, USA
    PublisherIEEE
    Pages139-148
    Number of pages10
    ISBN (Print)0818606541
    Publication statusPublished - 1985

    Fingerprint

    Scheduling algorithms
    Scheduling
    Parallel processing systems
    Processing
    Robots

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Kasahara, H., & Narita, S. (1985). APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS. In Unknown Host Publication Title (pp. 139-148). New York, NY, USA: IEEE.

    APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS. / Kasahara, Hironori; Narita, Seinosuke.

    Unknown Host Publication Title. New York, NY, USA : IEEE, 1985. p. 139-148.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Kasahara, H & Narita, S 1985, APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS. in Unknown Host Publication Title. IEEE, New York, NY, USA, pp. 139-148.
    Kasahara H, Narita S. APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS. In Unknown Host Publication Title. New York, NY, USA: IEEE. 1985. p. 139-148
    Kasahara, Hironori ; Narita, Seinosuke. / APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS. Unknown Host Publication Title. New York, NY, USA : IEEE, 1985. pp. 139-148
    @inproceedings{c419c829cf5846b89bcf012dcc2dcad5,
    title = "APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS.",
    abstract = "The multiprocessor scheduling problem has so far been regarded as impractical because the problem itself is NP-hard in the strong sense, therefore too difficult to solve, and involves several assumptions which do not appear to be applicable to actual parallel processing systems. The authors present two powerful and practical static scheduling algorithms named DF/IHS and CP/MISF and demonstrate their practicality by application to the parallel processing of continuous systems simulation and robot arm control computation on an actual multiprocessor system. A discussion is also presented of how the static scheduling algorithms are incorporated for efficient parallel processing on multiprocessor supercomputing systems. The authors show that the combined use of static and dynamic scheduling will be a powerful approach for the development of future supercomputing systems.",
    author = "Hironori Kasahara and Seinosuke Narita",
    year = "1985",
    language = "English",
    isbn = "0818606541",
    pages = "139--148",
    booktitle = "Unknown Host Publication Title",
    publisher = "IEEE",

    }

    TY - GEN

    T1 - APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS.

    AU - Kasahara, Hironori

    AU - Narita, Seinosuke

    PY - 1985

    Y1 - 1985

    N2 - The multiprocessor scheduling problem has so far been regarded as impractical because the problem itself is NP-hard in the strong sense, therefore too difficult to solve, and involves several assumptions which do not appear to be applicable to actual parallel processing systems. The authors present two powerful and practical static scheduling algorithms named DF/IHS and CP/MISF and demonstrate their practicality by application to the parallel processing of continuous systems simulation and robot arm control computation on an actual multiprocessor system. A discussion is also presented of how the static scheduling algorithms are incorporated for efficient parallel processing on multiprocessor supercomputing systems. The authors show that the combined use of static and dynamic scheduling will be a powerful approach for the development of future supercomputing systems.

    AB - The multiprocessor scheduling problem has so far been regarded as impractical because the problem itself is NP-hard in the strong sense, therefore too difficult to solve, and involves several assumptions which do not appear to be applicable to actual parallel processing systems. The authors present two powerful and practical static scheduling algorithms named DF/IHS and CP/MISF and demonstrate their practicality by application to the parallel processing of continuous systems simulation and robot arm control computation on an actual multiprocessor system. A discussion is also presented of how the static scheduling algorithms are incorporated for efficient parallel processing on multiprocessor supercomputing systems. The authors show that the combined use of static and dynamic scheduling will be a powerful approach for the development of future supercomputing systems.

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

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

    M3 - Conference contribution

    AN - SCOPUS:0022307896

    SN - 0818606541

    SP - 139

    EP - 148

    BT - Unknown Host Publication Title

    PB - IEEE

    CY - New York, NY, USA

    ER -