2013
DOI: 10.1007/978-3-642-37959-8_7
|View full text |Cite
|
Sign up to set email alerts
|

Many-Threaded Differential Evolution on the GPU

Abstract: Differential evolution (DE) is an efficient populational meta-heuristic optimization algorithm that has been applied to many difficult real world problems. Due to the relative simplicity of its operations and real encoded data structures, it is very suitable for a parallel implementation on multicore systems and on the GPUs that nowadays reach peak performance of hundreds and thousands of giga FLOPS (floating-point operations per second). In this chapter, we present a simple yet highly parallel implementation … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 34 publications
0
2
0
Order By: Relevance
“…A limitation that is immersed when using sequential versions of DE algorithms when it is necessary to solve real optimization problems is their execution time. In works such as [4], [7], [12], [3] parallel versions of the algorithms have been implemented to reduce this inconvenience. Therefore, the use of Graphical Processing Units (GPUs) used as a means of parallelization are gaining more and more importance due to their great computing potential, scalability, and low cost.…”
Section: Introductionmentioning
confidence: 99%
“…A limitation that is immersed when using sequential versions of DE algorithms when it is necessary to solve real optimization problems is their execution time. In works such as [4], [7], [12], [3] parallel versions of the algorithms have been implemented to reduce this inconvenience. Therefore, the use of Graphical Processing Units (GPUs) used as a means of parallelization are gaining more and more importance due to their great computing potential, scalability, and low cost.…”
Section: Introductionmentioning
confidence: 99%
“…DE was initially developed to solve global optimization problems in continuous spaces [10] and it quickly became a widely used optimization algorithm due to its characteristics of fast convergence and high capacity for exploration of feasible solutions to hard optimization problems [11]- [14].…”
Section: Introductionmentioning
confidence: 99%