APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS.

Hironori Kasahara*, Seinosuke Narita

*この研究の対応する著者

研究成果: Conference contribution

7 被引用数 (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.

本文言語English
ホスト出版物のタイトルUnknown Host Publication Title
出版社IEEE
ページ139-148
ページ数10
ISBN(印刷版)0818606541
出版ステータスPublished - 1985 12 1

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「APPROACH TO SUPERCOMPUTING USING MULTIPROCESSOR SCHEDULING ALGORITHMS.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル