SciELO - Scientific Electronic Library Online

 
vol.7 número3Polygonal Approximation of Contour Shapes Using Corner DetectorsMulti-agent system for the making of intelligence and interactive decisions within the learner's learning process in a web-based education environment índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • No hay artículos similaresSimilares en SciELO

Compartir


Journal of applied research and technology

versión On-line ISSN 2448-6736versión impresa ISSN 1665-6423

Resumen

LAGUNA-SANCHEZ, Gerardo A. et al. Comparative Study of Parallel Variants for a Particle Swarm Optimization Algorithm Implemented on a Multithreading GPU. J. appl. res. technol [online]. 2009, vol.7, n.3, pp.292-307. ISSN 2448-6736.

The Particle Swarm Optimization (PSO) algorithm is a well known alternative for global optimization based on a bio-inspired heuristic. PSO has good performance, low computational complexity and few parameters. Heuristic techniques have been widely studied in the last twenty years and the scientific community is still interested in technological alternatives that accelerate these algorithms in order to apply them to bigger and more complex problems. This article presents an empirical study of some parallel variants for a PSO algorithm, implemented on a Graphic Process Unit (GPU) device with multi-thread support and using the most recent model of parallel programming for these cases. The main idea is to show that, with the help of a multithreading GPU, it is possible to significantly improve the PSO algorithm performance by means of a simple and almost straightforward parallel programming, getting the computing power of cluster in a conventional personal computer.

Palabras llave : Multithreading GPU; PSO; general-purpose GPU; parallel programming; global optimization.

        · resumen en Español     · texto en Inglés

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons