Experimenting with X10 for Parallel Constraint-Based Local Search

Danny Munera (1) , Daniel Diaz (1) , Salvador Abreu (2)

1 CRI - Centre de Recherche en Informatique de Paris 1
2 CENTRIA - Centre for Artificial Intelligence

In this study, we have investigated the adequacy of the PGAS parallel language X10 to implement a Constraint-Based Local Search solver. We decided to code in this language to bene fit from the ease of use and architectural independence from parallel resources which it o ffers. We present the implementation strategy, in search of di fferent sources of parallelism in the context of an implementation of the Adaptive Search algorithm. We 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.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Danny Munera, Daniel Diaz, Salvador Abreu. Experimenting with X10 for Parallel Constraint-Based Local Search. 13th International Colloquium on Implementation of Constraint and LOgic Programming Systems (CICLOPS 2013), Aug 2013, Istanbul, Turkey. pp.33-47. ⟨hal-00874645⟩