Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform

Date published

2014-06-10

Free to read from

Supervisor/s

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier Science B.V., Amsterdam

Department

Type

Article

ISSN

0743-7315

Format

Citation

Michal Czapinski, Stuart Barnes. Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform. Journal of Parallel and Distributed Computing, Volume 71, Issue 6, June 2011, Pages 802-811- Special Issue on Cloud Computing.

Abstract

The introduction of NVidia's powerful Tesla GPU hardware and Compute Unified Device Architecture (CUDA) platform enable many-core parallel programming. As aresult, existing algorithms implemented on aGPU can run many times faster than on modern CPUs. Relatively little research has been done so far on GPU implementations of discrete optimisation algorithms. In this paper, two approaches to parallel GPU evaluation of the Permutation Flowshop Scheduling Problem, with makespan and total flowtime criteria, are proposed. These methods can be employed in most population-based algorithms, e.g. genetic algorithms, Ant Colony Optimisation, Particle Swarm Optimisation, and Tabu Search. Extensive computational experiments, on Tabu Search for Flowshop with both criteria, followed by statistical analysis, confirm great computational capabilities of GPU hardware. AGPU implementation of Tabu Search runs up to 89 times faster than its CPU counterpart.

Description

Software Description

Software Language

Github

Keywords

DOI

Rights

NOTICE: this is the author’s version of a work that was accepted for publication in Journal of Parallel and Distributed Computing. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Parallel and Distributed Computing, Volume 71, Issue 6, June 2011, Pages 802-811- Special Issue on Cloud Computing. DOI:10.1016/j.jpdc.2011.02.006

Relationships

Relationships

Resources

Funder/s