loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Parallel and Distributed Processing Symposium (IPDPS'03)
An Accurate and Efficient Parallel Genetic Algorithm to Schedule Tasks on a Cluster
Nice, France
April 22-April 26
ISBN: 0-7695-1926-1
Michelle Moore, Texas A&M University-Corpus Christi
Recent breakthroughs in the mathematical estimation of parallel genetic algorithm parameters by Cant?-Paz [12] 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.
Index Terms:
genetic algorithms, scheduling algorithms, parallel genetic algorithms, NP-complete, parallel scheduling
Citation:
Michelle Moore, "An Accurate and Efficient Parallel Genetic Algorithm to Schedule Tasks on a Cluster," ipdps, pp.145a, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.