WestminsterResearch

Generic systolic array for genetic algorithms

Megson, Graham M. and Bland, Ian M. (1997) Generic systolic array for genetic algorithms. Computers and Digital techniques, IEE Proceedings E, 144 (2). pp. 107-119. ISSN 1350-2387

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumbe...

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

Item Type:Article
Uncontrolled Keywords:Encoding, genetic algorithms, logic design, systolic arrays, chromosome length, fitness function, generic systolic array, genetic algorithms, hybrid systems inherent parallelism, island-style population management systolic design, unidirectional pipelining
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:5699
Deposited On:27 Jan 2009 10:48
Last Modified:19 Oct 2009 16:41

Repository Staff Only: item control page