Towards Parallel Constraint-Based Local Search with the X10 Language

Abstract

International audienceIn this study, we started to investigate how the Partitioned Global Address Space (PGAS) programming language X10 would suit the implementation of a Constraint-Based Local Search solver. We wanted to code in this language because we expect to gain from its ease of use and independence from specifi c parallel architectures. We present the implementation strategy, and search for di fferent sources of parallelism. We discuss the algorithms, their implementations and present a performance evaluation on a representative set of benchmarks