Accessibility navigation

Implementing a generic systolic array for genetic algorithms

Bland, I. M. and Megson, G. (1996) Implementing a generic systolic array for genetic algorithms. In: Chawdhury, P. and Roy, R. (eds.) Proc. First On-Line Workshop on Soft Computing. Springer Verlag. ISBN 3540762140

Full text not archived in this repository.

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


We have designed a highly parallel design for a simple genetic algorithm using a pipeline of systolic arrays. The systolic design provides high throughput and unidirectional pipelining by exploiting the implicit parallelism in the genetic operators. The design is significant because, unlike other hardware genetic algorithms, it is independent of both the fitness function and the particular chromosome length used in a problem. We have designed and simulated a version of the mutation array using Xilinix FPGA tools to investigate the feasibility of hardware implementation. A simple 5-chromosome mutation array occupies 195 CLBs and is capable of performing more than one million mutations per second. I. Introduction Genetic algorithms (GAs) are established search and optimization techniques which have been applied to a range of engineering and applied problems with considerable success [1]. They operate by maintaining a population of trial solutions encoded, using a suitable encoding scheme.

Item Type:Book or Report Section
ID Code:7449
Publisher:Springer Verlag

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

Page navigation