2016 Elektro 2016
DOI: 10.1109/elektro.2016.7512108
|View full text |Cite
|
Sign up to set email alerts
|

Using LLVM-based JIT compilation in genetic programming

Abstract: Abstract-The paper describes an approach to implementing genetic programming, which uses the LLVM library to justin-time compile/interpret the evolved abstract syntax trees. The solution is described in some detail, including a parser (based on FlexC++ and BisonC++) that can construct the trees from a simple toy language with C-like syntax. The approach is compared with a previous implementation (based on direct execution of trees using polymorphic functors) in terms of execution speed.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…because there are many test cases, it can be beneficial not to interpret the code but to compile it and run the compiled binary code (e.g. Harding [22], Gregor and Spalek [20]). However running a traditional compiler is expensive and Fukunaga et al [15] and Vasicek and Slany [76] have advocated generating machine code inside the GP system and executing that.…”
Section: Faster Fitnessmentioning
confidence: 99%
“…because there are many test cases, it can be beneficial not to interpret the code but to compile it and run the compiled binary code (e.g. Harding [22], Gregor and Spalek [20]). However running a traditional compiler is expensive and Fukunaga et al [15] and Vasicek and Slany [76] have advocated generating machine code inside the GP system and executing that.…”
Section: Faster Fitnessmentioning
confidence: 99%