On the scalability of evolvable hardware architectures: comparison of systolic array and Cartesian genetic programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8051
- @Article{mora:GPEM,
-
author = "Javier Mora and Ruben Salvador and
Eduardo {de la Torre}",
-
title = "On the scalability of evolvable hardware
architectures: comparison of systolic array and
Cartesian genetic programming",
-
journal = "Genetic Programming and Evolvable Machines",
-
year = "2019",
-
volume = "20",
-
number = "2",
-
pages = "155--186",
-
month = jun,
-
keywords = "genetic algorithms, genetic programming, Cartesian
genetic programming, FPGA, Evolvable hardware, EHW,
Dynamic partial reconfiguration, Systolic array,
Scalability",
-
URL = "http://link.springer.com/article/10.1007/s10710-018-9340-5",
-
DOI = "doi:10.1007/s10710-018-9340-5",
-
abstract = "Evolvable hardware allows the generation of circuits
that are adapted to specific problems by using an
evolutionary algorithm (EA). Dynamic partial
reconfiguration of FPGA LUTs allows making the
processing elements (PEs) of these circuits small and
compact, thus allowing large scale circuits to be
implemented in a small FPGA area. This facilitates the
use of these techniques in embedded systems with
limited resources. The improvement on
resource-efficient implementation techniques has
allowed increasing the size of processing architectures
from a few PEs to several hundreds. However, these
large sizes pose new challenges for the EA and the
architecture, which may not be able to take full
advantage of the computing capabilities of its PEs. In
this article, two different topologies, systolic array
(SA) and Cartesian genetic programming (CGP), are
scaled from small to large sizes and analysed,
comparing their behaviour and efficiency at different
sizes. Additionally, improvements on SA connectivity
are studied. Experimental results show that, in
general, SA is considerably more resource-efficient
than CGP, needing up to 60percent fewer FPGA resources
(LUTs) for a solution with similar performance, since
the LUT usage per PE is 5 times smaller. Specifically,
10 by 10 SA has better performance than 5 by 10 CGP,
but uses 50percent fewer resources",
- }
Genetic Programming entries for
Javier Mora de Sambricio
Ruben Salvador
Eduardo de la Torre
Citations