Parallel neighbourhood search on many-core platforms

Authors:
Yuet Ming Lam;Kuen Hung Tsoi;Wayne Luk
Affiliations:
Faculty of Information Technology, Macau University of Science and Technology, Room A210, Taipa, Macau, China;Department of Computing, Imperial College London, South Kensington Campus, London SW7 2AZ, UK;Department of Computing, Imperial College London, South Kensington Campus, London SW7 2AZ, UK
Venue:
International Journal of Computational Science and Engineering
Year:
2013

Citing 14
Cited 0

Parallel simulated annealing algorithms

Journal of Parallel and Distributed Computing
Genetic Algorithms and Punctuated Equilibria in VLSI

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Optimization Using Distributed Genetic Algorithms

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Effects of Chromosome Migration on a Parallel and Distributed Genetic Algorithm

ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Stochastic Optimization (Scientific Computation)

Stochastic Optimization (Scientific Computation)
Hardware Implementation of 2-Opt Local Search Algorithm for the Traveling Salesman Problem

RSP '07 Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping
An Efficient Fine-grained Parallel Genetic Algorithm Based on GPU-Accelerated

NPC '07 Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops
Performance Comparison of Graphics Processors to Reconfigurable Logic: A Case Study

IEEE Transactions on Computers
Speeding up FPGA placement via partitioning and multithreading

International Journal of Reconfigurable Computing
Parallel simulated annealing for the vehicle routing problem with time windows

EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
A GPU-based iterated tabu search for solving the quadratic 3-dimensional assignment problem

AICCSA '10 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010
Parallelizing Simulated Annealing-Based Placement Using GPGPU

FPL '10 Proceedings of the 2010 International Conference on Field Programmable Logic and Applications
A highly-parallel TSP solver for a GPU computing platform

NMA'10 Proceedings of the 7th international conference on Numerical methods and applications
Placement by Simulated Annealing on a Multiprocessor

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a parallel search parallel move approach to parallelise neighbourhood search algorithms on many-core platforms. In this approach, a large number of searches are run concurrently and coordinated periodically. Iteratively, each search generates and evaluates multiple moves in parallel. The proposed approach can fully utilise the computing capability of many-core platforms under various platform specific constraints. A parallel simulated annealing algorithm for solving the travelling salesman problem is developed using the parallel search parallel move scheme and implemented on an NVIDIA Tesla C2050 GPU platform. We evaluate the performance of our approach against a multi-threaded CPU implementation on a server containing two Intel Xeon X5650 CPUs 12 cores in total. The experimental results of 20 benchmark problems show that the GPU implementation achieves 99 times speedup on average in solution space exploration speed. In terms of effectiveness, the GPU implementation is capable of finding good solutions 39.5 times faster or with 21.7% solution quality improvement given the same searching time.