A GPU Implementation of Parallel Constraint-Based Local Search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

A GPU Implementation of Parallel Constraint-Based Local Search

Abstract

In this paper we study the performance of constraint-based local search solvers on a GPU. The massively parallel architecture of the GPU makes it possible to explore parallelism at two different levels inside the local search algorithm. First, by executing multiple copies of the algorithm in a multiwalk manner and, second, by evaluating large neighborhoods in parallel in a single-walk manner. Experiments on three wellknown problem benchmarks indicate that the current GPU implementation is up to 17 times faster than a well-tuned sequential algorithm implemented on a desktop computer.
Fichier principal
Vignette du fichier
PDP_2014.pdf (421.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04416685 , version 1 (25-01-2024)

Licence

Copyright

Identifiers

Cite

Alejandro Arbelaez, Philippe Codognet. A GPU Implementation of Parallel Constraint-Based Local Search. 2014 22nd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), Feb 2014, Torino, France. pp.648-655, ⟨10.1109/PDP.2014.28⟩. ⟨hal-04416685⟩
11 View
4 Download

Altmetric

Share

Gmail Facebook X LinkedIn More