Massively parallel differential evolution–pattern search optimization with graphics hardware acceleration: an investigation on bound constrained optimization problems

Massively parallel differential evolution–pattern search optimization with graphics hardware acceleration: an investigation on bound constrained optimization problems

0.00 Avg rating0 Votes
Article ID: iaor20116092
Volume: 50
Issue: 3
Start Page Number: 417
End Page Number: 437
Publication Date: Jul 2011
Journal: Journal of Global Optimization
Authors:
Keywords: heuristics, optimization, heuristics: local search
Abstract:

This paper presents a novel parallel Differential Evolution (DE) algorithm with local search for solving function optimization problems, utilizing graphics hardware acceleration. As a population‐based meta‐heuristic, DE was originally designed for continuous function optimization. Graphics Processing Units (GPU) computing is an emerging desktop parallel computing technology that is becoming popular with its wide availability in many personal computers. In this paper, the classical DE was adapted in the data‐parallel CPU‐GPU heterogeneous computing platform featuring Single Instruction‐Multiple Thread (SIMT) execution. The global optimal search of the DE was enhanced by the classical local Pattern Search (PS) method. The hybrid DE–PS method was implemented in the GPU environment and compared to a similar implementation in the common computing environment with a Central Processing Unit (CPU). Computational results indicate that the GPU‐accelerated SIMT‐DE‐PS method is orders of magnitude faster than the corresponding CPU implementation. The main contribution of this paper is the parallelization analysis and performance analysis of the hybrid DE–PS with GPU acceleration. The research results demonstrate a promising direction for high speed optimization with desktop parallel computing on a personal computer.

Reviews

Required fields are marked *. Your email address will not be published.