For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Lookahead Heuristic for Heterogeneous Multiprocessor Scheduling with Communication Costs
Dingchao LI Akira MIZUNO Yuji IWAHORI Naohiro ISHII
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1997/04/25
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Parallel and Distributed Supercomputing)
parallel processing, heterogeneous multiprocessors, task graphs, communication costs, scheduling heuristics,
Full Text: PDF(567.4KB)>>
This paper describes a new approach to the scheduling problem that assigns tasks of a parallel program described as a task graph onto parallel machines. The approach handles interprocessor communication and heterogeneity, based on using both the theoretical results developed so far and a lookahead scheduling strategy. The experimental results on randomly generated task graphs demonstrate the effectiveness of this scheduling heuristic.