Automatic Machine Code Generation for a Transport Triggered Architecture using Cartesian Genetic Programming

Research output: Contribution to journalArticle

Author(s)

Department/unit(s)

Publication details

JournalJournal of Adaptive, Resilient and Autonomic Systems
DatePublished - 2012
Issue number4
Volume3
Number of pages19
Pages (from-to)32-50
Original languageEnglish

Abstract

Transport triggered architectures are used for implement-
ing bio-inspired systems due to their simplicity, modularity and fault-
tolerance. However, producing ecient, optimised machine code for such
architectures is an extremely dicult task, as the computational complex-
ity has moved from the hardware-level to the software-level. This paper
presents the application of Cartesian Genetic Programming to the evo-
lution of machine code for a simple implementation of a transport trig-
gered architecture. The eectiveness of the algorithm is demonstrated by
evolving machine code for a 4-bit multiplier with three dierent levels of
parallelism. The results show that 100% successful solutions were found
by CGP and by further optimising the size of the solutions, it is possible
to nd ecient implementations of the 4-bit multiplier. Further analysis
of the solutions showed that the use of loops within the CGP function set
could be benecial and was demonstrated by repeating the earlier 4-bit
multiplier experiment with the addition of a loop function. The further
results showed that the use of a loop function did not signincatly aect
the performance of the CGP algorithm but a reduction of up to 55%
in the solution size was observed, which could have the potential to be
classed as \human competitive".

Projects

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations