DocumentCode
2890054
Title
A Genetic Algorithm for Scheduling Tasks onto Dynamically Reconfigurable Hardware
Author
Qu, Yang ; Soininen, Juha-Pekka ; Nurmi, Jari
Author_Institution
Tech. Res. Centre of Finland, Oulu
fYear
2007
fDate
27-30 May 2007
Firstpage
161
Lastpage
164
Abstract
In this paper, a genetic algorithm (GA) for scheduling tasks onto dynamically reconfigurable devices is presented. The scheduling problem is NP-hard and more complicated than multiprocessor scheduling, because both the task allocation and the configurations need to be carefully managed. The approach has been validated with a number of random task graphs. The results show that the GA approach has good convergence and it is in average 8.6% better than a list-based scheduler for large task graphs of various sizes.
Keywords
flow graphs; genetic algorithms; processor scheduling; reconfigurable architectures; task analysis; NP-hard problem; dynamically reconfigurable hardware; genetic algorithm; random task graphs; task allocation; tasks scheduling; Circuits; Communication system control; Delay; Dynamic scheduling; Genetic algorithms; Hardware; Prefetching; Processor scheduling; Runtime; Tiles;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2007. ISCAS 2007. IEEE International Symposium on
Conference_Location
New Orleans, LA
Print_ISBN
1-4244-0920-9
Electronic_ISBN
1-4244-0921-7
Type
conf
DOI
10.1109/ISCAS.2007.378246
Filename
4252596
Link To Document