30 June 1994 Asynchronous parallelism in steady-state genetic algorithms
Author Affiliations +
Abstract
Genetic algorithms (GAs) are becoming increasingly popular for signal detection, often in conjunction with neural networks. The time-intensive nature of these techniques has fostered an interest in parallel implementations. Genitor is a widely used algorithm belonging to the class of steady-state GAs which are generally believed to contain little exploitable parallelism. Parallel versions have involved fundamental changes to the algorithm by introducing islands. This paper describes how Genitor can be parallelized virtually as is, with nearly linear speedup, by rearranging the order of some of the genetic operations. An analytical method is derived which can be used for determining the amount of parallelism that can be achieved. An implementation for a shared-memory machine is described, and the resulting execution is shown to support the analysis.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Vahl Scott Gordon, "Asynchronous parallelism in steady-state genetic algorithms", Proc. SPIE 2304, Neural and Stochastic Methods in Image and Signal Processing III, (30 June 1994); doi: 10.1117/12.179238; https://doi.org/10.1117/12.179238
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top