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...

Full description

Saved in:
Bibliographic Details
Published in:Parallel Processing Symposium, 10th International (IPPS '96 pp. 606 - 612
Main Authors: Hart, W.E., Baden, S., Belew, R.K., Kohn, S.
Format: Conference Proceeding
Language:English
Published: IEEE 1996
Subjects:
Cost function
Genetic algorithms
Performance analysis
Runtime
ISBN:0818672552, 9780818672552
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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