GPU-Based evaluation to accelerate particle swarm algorithm

  • Authors:
  • Miguel C$#225/rdenas-Montes;Miguel A. Vega-Rodrí/guez;Juan José/ Rodrí/guez-V$#225/zquez;Antonio Gó/mez-Iglesias

  • Affiliations:
  • Department of Fundamental Research, Centro de Investigaciones Energé/ticas, Medioambientales y Tecnoló/gicas, Madrid, Spain;Dept. Technologies of Computers and Communications, University of Extremadura, ARCO Research Group, C$#225/ceres, Spain;Department of Fundamental Research, Centro de Investigaciones Energé/ticas, Medioambientales y Tecnoló/gicas, Madrid, Spain;National Laboratory of Fusion, Centro de Investigaciones Energé/ticas Medioambientales y Tecnoló/gicas, Madrid, Spain

  • Venue:
  • EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.