The iso-level scheduling heuristic for heterogeneous processors

Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous resources. We present a new scheduling heuristic for heterogeneous processors, whic...

Full description

Saved in:
Bibliographic Details
Published inProceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing pp. 335 - 350
Main Authors Beaumont, O., Boudet, V., Robert, Y.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2002
Subjects
Conferences
Delay
Parallel machines
Processor scheduling
Scheduling algorithm
Testing
Online AccessGet full text

Cover

More Information
Summary:Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous resources. We present a new scheduling heuristic for heterogeneous processors, which improves the load-balancing achieved at each decision step while keeping a low complexity. Experimental comparisons with five heuristics taken from the literature (BIL, GDL, CPOP, HEFT and PCT) and using six classical testbeds, show very favorable results.
ISBN:9780769514444
0769514448
DOI:10.1109/EMPDP.2002.994304