Add to ORKGAbstract We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on hard-ware 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...