Analysis of the numerical effects of parallelism on a parallel genetic algorithm

Examines the effects of relaxed synchronization on both the numerical and parallel efficiency of parallel genetic algorithms (GAs). We describe a coarse-grain geographically structured parallel genetic algorithm. Our experiments provide preliminary evidence that asynchronous versions of these algori...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel Processing Symposium, 10th International (IPPS '96 s. 606 - 612
Hlavní autoři: Hart, W.E., Baden, S., Belew, R.K., Kohn, S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1996
Témata:
Cost function
Genetic algorithms
Performance analysis
Runtime
ISBN:0818672552, 9780818672552
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Examines the effects of relaxed synchronization on both the numerical and parallel efficiency of parallel genetic algorithms (GAs). We describe a coarse-grain geographically structured parallel genetic algorithm. Our experiments provide preliminary evidence that asynchronous versions of these algorithms have a lower run-time than synchronous GAs. Our analysis shows that this improvement is due to (1) reduced synchronization costs and (2) higher numerical efficiency (e.g. fewer function evaluations) for the asynchronous GAs. This analysis includes a critique of the utility of traditional parallel performance measures for parallel GAs.
ISBN:0818672552
9780818672552
DOI:10.1109/IPPS.1996.508119