DocumentCode
2013428
Title
Segmented min-min: a static mapping algorithm for meta-tasks on heterogeneous computing systems
Author
Wu, Min-You ; Shu, Wei ; Zhang, Hong
Author_Institution
Dept. of Electr. & Comput. Eng., New Mexico Univ., Albuquerque, NM, USA
fYear
2000
fDate
2000
Firstpage
375
Lastpage
385
Abstract
The min-min algorithm is a simple algorithm. It runs fast and delivers good performance. However, the min-min algorithm schedules small tasks first, resulting in some load imbalance. We present an algorithm which improves the min-min algorithm by scheduling large tasks first. The new algorithm, segmented min-min, balances the load well and demonstrates even better performance in both makespan and running time
Keywords
resource allocation; scheduling; software performance evaluation; heterogeneous computing systems; load balancing; makespan; meta-tasks; performance; running time; segmented min-min algorithm; static mapping algorithm; task scheduling; Algorithm design and analysis; Computational modeling; Computer networks; Genetic algorithms; Heuristic algorithms; High-speed networks; Load management; Processor scheduling; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Heterogeneous Computing Workshop, 2000. (HCW 2000) Proceedings. 9th
Conference_Location
Cancun
ISSN
1097-5209
Print_ISBN
0-7695-0556-2
Type
conf
DOI
10.1109/HCW.2000.843759
Filename
843759
Link To Document