Towards Parallel Constraint-Based Local Search with the X10 Language

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

Cited literature [16 references]  Display  Hide  Download

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

File

inap-2013.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00874633, version 1

Collections

Citation

Danny Munera, Daniel Diaz, Salvador Abreu. Towards Parallel Constraint-Based Local Search with the X10 Language. 20th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013), Sep 2013, Kiel, Germany. pp.168-182. ⟨hal-00874633⟩

Share

Metrics

Record views

196

Files downloads

333