Accessibility navigation

Generic systolic array for genetic algorithms

Megson, G. and Bland, I. M. (1997) Generic systolic array for genetic algorithms. IEE Proceedings - Computers and Digital Techniques', 144 (2). pp. 107-119. ISSN 1350-2387

Text (Does not have figures) - Accepted Version
· Please see our End User Agreement before downloading.


It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1049/ip-cdt:19971126


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 management

Item Type:Article
ID Code:5729
Uncontrolled Keywords:chromosome length , fitness function , generic systolic array , genetic algorithms , hybrid systems , inherent parallelism , island-style population management , systolic design , unidirectional pipelining
Publisher Statement:This paper is a postprint of a paper submitted to and accepted for publication in 'IET Computers and Digital Techniques' and is subject to Institution of Engineering and Technology Copyright. The copy of record is available at IET Digital Library.


Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation