GPU-based evaluation to accelerate particle swarm algorithm

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the advent of the cards GPU, many computational problems have suffered from a net increase of performance. Nevertheless, the improvement depends strongly on the usage of the technology and the porting process used in the adaptation of the problem. These aspects are critical in order that the improvement of the performance of the code adapted to GPU is significant. This article focus on the study of the strategies for the porting of Particle Swarm Algorithm with parallel-evaluation of Schwefel Problem 1.2 and Rosenbrock function. The implementation evaluates the population in GPU, whereas the other intrinsic operators of the algorithm are executed in CPU. The design, the implementation and the associated issues related to GPU execution context are evaluated and presented. The results demonstrate the effectiveness of the proposed approach and its capability to effectively exploit the architecture of GPU. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Cárdenas-Montes, M., Vega-Rodríguez, M. A., Rodríguez-Vázquez, J. J., & Gómez-Iglesias, A. (2012). GPU-based evaluation to accelerate particle swarm algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6927 LNCS, pp. 272–279). https://doi.org/10.1007/978-3-642-27549-4_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free