Parallelization of the Cuckoo Search using CUDA Architecture
7th International Conference on Applied Mathematics, Simulation, Modelling (ASM ’13), 2013
@article{jovanovic2013parallelization,
title={Parallelization of the Cuckoo Search using CUDA Architecture},
author={Jovanovic, Raka and Tuba, Milan},
year={2013}
}
Cuckoo Search is one of the recent swarm itelligence metaheuritics. It has been succesfuly applied to a number of optimization problems but is stil not very well researched. In this paper we present a parallelized version of the Cuckoo Search algorithm. The parallelization is implemented using CUDA architecture. The algorithm is significantly changed compared to the sequential version. Changes are partialy done to exploit the power of mass parallelization by the graphical processing unit and partialy as a consequence of the memory access restrictions that exist in CUDA. Tests on standard benchmark functions show that our proposed parallized algorithm greatly decreases the execution time and achieves similar or slightly better quality of the results compared to the sequential algorithm.
April 1, 2013 by hgpu