Bland, Ian M. and Megson, Graham M. (1998) The systolic array genetic algorithm, an example of systolic arrays as a reconfigurable design methodology. In: Pocek, Kenneth L. and Arnold, Jeffrey M., (eds.) IEEE symposium on FPGAs for custom computing machines, 1998. IEEE, pp. 260-261. ISBN 0818689005
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/FPGA.1998.707907
We have designed and constructed a genetic algorithm engine using a systolic design methodology. The approach has a number of advantages. Firstly the design processes is systematic. A C source code version of the algorithm is used as a starting point and progressively the code is re-written into a form from where systolic cells can be designed. Secondly the modular nature of the arrays allow easy expansion of the design for different requirements (larger populations in this example). Hardware designs are re-used extensively and, in combination with reconfigurable computing techniques, can be swapped in or out on an application specific basis to construct arrays of the correct size. This can also be extended to swapping in and out whole elements of the macro-pipeline so that alternative operators, such as Tournament Selection can be employed. Thirdly, a traditional benefit of systolic arrays applies. The resultant design is massively parallel and significant throughput can be achieved.
|Item Type:||Book Section|
|Uncontrolled Keywords:||Genetic algorithms, reconfigurable architectures, systolic arrays, genetic algorithm, genetic algorithm engine massively parallel, reconfigurable design, systolic array, systolic arrays|
|Research Community:||University of Westminster > Electronics and Computer Science, School of|
|Deposited On:||27 Jan 2009 16:27|
|Last Modified:||19 Oct 2009 12:25|
Repository Staff Only: item control page