University of Pardubice
In this paper, the authors have investigated the adequacy of the PGAS parallel language X10 to implement a Constraint-Based Local Search solver. They decided to code in this language to benefit from the ease of use and architectural independence from parallel resources which it offers. They present the implementation strategy, in search of different sources of parallelism in the context of an implementation of the Adaptive Search algorithm. They extensively discuss the algorithm and its implementation. The performance evaluation on a representative set of benchmarks shows close to linear speed-ups, in all the problems treated.