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.
|Title of host publication||Unknown Host Publication Title|
|Number of pages||10|
|Publication status||Published - 1985 Dec 1|
ASJC Scopus subject areas