Skip to Main content Skip to Navigation
Conference papers

Experiments in Parallel Constraint-Based Local Search

Abstract : We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on hardware with several hundreds of processors. We choose as basic constraint solving algorithm for these experiments the "adaptive search" method, an efficient sequential local search method for Constraint Satisfaction Problems. The implemented algorithm is a parallel version of adaptive search in a multiple independent-walk manner, that is, each process is an independent search engine and there is no communication between the simultaneous computations. Preliminary performance evaluation on a variety of classical CSPs benchmarks shows that speedups are very good for a few tens of processors, and good up to a few hundreds of processors.
Document type :
Conference papers
Complete list of metadata
Contributor : Daniel Diaz <>
Submitted on : Friday, January 27, 2012 - 3:23:21 PM
Last modification on : Saturday, September 11, 2021 - 3:17:40 AM

Links full text



Yves Caniou, Philippe Codognet, Daniel Diaz, Salvador Abreu. Experiments in Parallel Constraint-Based Local Search. 11th European conference on Evolutionary computation in combinatorial optimization (EvoCOP'11), Apr 2011, Torino, Italy. pp.96-107, ⟨10.1007/978-3-642-20364-0_9⟩. ⟨hal-00663789⟩



Record views