DocumentCode
1663829
Title
An accurate and efficient parallel genetic algorithm to schedule tasks on a cluster
Author
Moore, Michelle
fYear
2003
Abstract
Recent breakthroughs in the mathematical estimation of parallel genetic algorithm parameters by Cantu-Paz (2000) are applied to the NP-complete problem of scheduling multiple tasks on a cluster of computers connected by a shared bus. Experiments reveal that the parallel scheduling algorithm develops very accurate schedules when the parameter guidelines are used.
Keywords
computational complexity; genetic algorithms; parallel algorithms; processor scheduling; workstation clusters; NP-complete problem; cluster of computers; mathematical estimation; parallel genetic algorithm; parameter guidelines; tasks scheduling; Communication channels; Concurrent computing; Genetic algorithms; Guidelines; Message passing; Microcomputers; NASA; NP-complete problem; Processor scheduling; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium, 2003. Proceedings. International
ISSN
1530-2075
Print_ISBN
0-7695-1926-1
Type
conf
DOI
10.1109/IPDPS.2003.1213276
Filename
1213276
Link To Document