Hironori Kasahara, Seinosuke Narita

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

7 Citations (Scopus)


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
Number of pages10
ISBN (Print)0818606541
Publication statusPublished - 1985 Dec 1

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS.'. Together they form a unique fingerprint.

  • Cite this

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