Location of Repository

Generic systolic array for genetic algorithms

By Graham Megson and Ian Michael Bland

Abstract

The authors present a systolic design for a simple GA mechanism which provides high throughput and unidirectional pipelining by exploiting the inherent parallelism in the genetic operators. The design computes in O(N+G) time steps using O(N2) cells where N is the population size and G is the chromosome length. The area of the device is independent of the chromosome length and so can be easily scaled by replicating the arrays or by employing fine-grain migration. The array is generic in the sense that it does not rely on the fitness function and can be used as an accelerator for any GA application using uniform crossover between pairs of chromosomes. The design can also be used in hybrid systems as an add-on to complement existing designs and methods for fitness function acceleration and island-style population managemen

Publisher: IET
Year: 1997
OAI identifier: oai:centaur.reading.ac.uk:5729

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.