Parallel Calculating of the Goal Function in Metaheuristics Using GPU

Authors:
Wojciech Bożejko;Czesław Smutnicki;Mariusz Uchroński
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372
Venue:
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Year:
2009

Citing 2
Cited 2

A parallel tabu search algorithm for large traveling salesman problems

Discrete Applied Mathematics
State of the Art in Parallel Search Techniques for Discrete Optimization Problems

IEEE Transactions on Knowledge and Data Engineering

Fast parallel cost function calculation for the flow shop scheduling problem

ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Population-based harmony search using GPU applied to protein structure prediction

International Journal of Computational Science and Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a metaheuristic optimization algorithm which uses single process (thread) to guide the search through the solution space. Thread performs in the cyclic way (iteratively) two main tasks: the goal function evaluation for a single solution or a set of solutions and management (solution filtering and selection, collection of history, updating). The latter task takes statistically 1-3% total iteration time, therefore we skip its acceleration as useless. The former task can be accelerated in parallel environments in various manners. We propose certain parallel small-grain calculation model providing the cost optimal method. Then, we carry out an experiment using Graphics Processing Unit (GPU) to confirm our theoretical results.