Effect of the block occupancy in GPGPU over the performance of particle swarm algorithm

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

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

  • Venue:
  • ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Diverse technologies have been used to accelerate the execution of Evolutionary Algorithms. Nowadays, the GPGPUcards have demonstrated a high efficiency in the improvement of the execution times in a wide range of scientific problems, including some excellent examples with diverse categories of Evolutionary Algorithms. Nevertheless, the studies in depth of the efficiency of each one of these technologies, and how they affect to the final performance are still scarce. These studies are relevant in order to reduce the execution time budget, and therefore affront higher dimensional problems. In this work, the improvement of the speed-up face to the percentage of threads used per block in the GPGPU card is analysed. The results conclude that a correct election of the occupancy --number of the threads per block-- contributes to win an additional speed-up.