Experimenting with X10 for Parallel Constraint-Based Local Search

Abstract : 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.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-paris1.archives-ouvertes.fr/hal-00874645
Contributor : Danny Munera <>
Submitted on : Friday, October 18, 2013 - 12:44:22 PM
Last modification on : Friday, September 27, 2019 - 12:16:02 PM
Long-term archiving on : Sunday, January 19, 2014 - 4:26:30 AM

File

ciclops13.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00874645, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

165

Files downloads

294