2014
DOI: 10.1007/978-3-662-45523-4_58
|View full text |Cite
|
Sign up to set email alerts
|

Automated Framework for General-Purpose Genetic Algorithms in FPGAs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Therefore, the population needs to be kept in a single memory that is accessed by the processing units that compute the operations of the algorithm. One approach is to generate a new population at each iteration of the algorithm (generational GA), where it is possible to have several parallel units that access to the population and generate new solutions [6], [7]. Nevertheless, the access to the memory that keeps the population may represent an important bottleneck when the level of parallelism increases.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, the population needs to be kept in a single memory that is accessed by the processing units that compute the operations of the algorithm. One approach is to generate a new population at each iteration of the algorithm (generational GA), where it is possible to have several parallel units that access to the population and generate new solutions [6], [7]. Nevertheless, the access to the memory that keeps the population may represent an important bottleneck when the level of parallelism increases.…”
Section: Introductionmentioning
confidence: 99%