DocumentCode
2211540
Title
Strengths and weaknesses of genetic list scheduling for heterogeneous systems
Author
Grajcar, Martin
Author_Institution
Fak. fur Math. und Inf., Passau Univ., Germany
fYear
2001
fDate
2001
Firstpage
123
Lastpage
132
Abstract
List scheduling combined with genetic algorithms has already been shown to be a powerful approach (Grajcar, 1999,Yu-Kwong Kwok and Ahmad, 1996). We investigate the problems associated with using a list scheduler for a heterogeneous system. Furthermore, we present cases, for which most list schedulers fail to find the optimum. We propose and experimentally evaluate novel ideas avoiding it
Keywords
genetic algorithms; processor scheduling; NP-complete; genetic algorithms; genetic list scheduling; heterogeneous systems; list schedulers; scheduling; Application software; Computer architecture; Computer science; Costs; Embedded system; Force measurement; Genetic algorithms; Process design; Processor scheduling; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Application of Concurrency to System Design, 2001. Proceedings. 2001 International Conference on
Conference_Location
Newcastle upon Tyne
Print_ISBN
0-7695-1071-X
Type
conf
DOI
10.1109/CSD.2001.981770
Filename
981770
Link To Document