Gravitational Search Algorithm Using CUDA

Many scientific and technical problems with massive computation requirements could benefit from the Graphics Processing Units (GPUs) using Compute Unified Device Architecture (CUDA) for high speed processing. Gravitational Search Algorithm (GSA) is a population-based metaheuristic algorithm that can...

Full description

Saved in:
Bibliographic Details
Published in2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies pp. 193 - 198
Main Authors Zarrabi, Amirreza, Karuppiah, Ettikan K., Yong Keh Kok, Ngo Chuan Hai, See, Simon
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2014
Subjects
Acceleration
CUDA
Graphic Processing Units
Graphics processing units
Gravitational Search Algorithm
Instruction sets
Kernel
Optimization
Sociology
Statistics
Online AccessGet full text

Cover

More Information
Summary:Many scientific and technical problems with massive computation requirements could benefit from the Graphics Processing Units (GPUs) using Compute Unified Device Architecture (CUDA) for high speed processing. Gravitational Search Algorithm (GSA) is a population-based metaheuristic algorithm that can be effectively implemented on GPU to reduce the execution time. In this paper we discuss possible approaches to parallelize GSA on graphics hardware using CUDA. An in-depth study of the computation efficiency of parallel algorithms and capability to effectively exploit the architecture of GPU is performed. Additionally, a comparative study of parallel and sequential GSA was carried out on a set of standard benchmark optimization functions. The results show a significant speedup that re-emphasizes the utility of CUDA based implementation for complex and computationally intensive parallel applications.
ISSN:2379-5352
DOI:10.1109/PDCAT.2014.38