 |
The open archive HAL of Paris 1 Panthéon-Sorbonne university |
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.
https://hal-paris1.archives-ouvertes.fr/hal-00663789
Contributor : Daniel Diaz Connect in order to contact the contributor
Submitted on : Friday, January 27, 2012 - 3:23:21 PM
Last modification on : Saturday, September 11, 2021 - 3:17:40 AM
Contributor : Daniel Diaz Connect in order to contact the contributor
Submitted on : Friday, January 27, 2012 - 3:23:21 PM
Last modification on : Saturday, September 11, 2021 - 3:17:40 AM
Links full text
