Towards Parallel Constraint-Based Local Search with the X10 Language - Université Paris 1 Panthéon-Sorbonne Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Towards Parallel Constraint-Based Local Search with the X10 Language

Daniel Diaz
Salvador Abreu

Résumé

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.
Fichier principal
Vignette du fichier
inap-2013.pdf (232.16 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00874633 , version 1 (18-10-2013)

Identifiants

  • HAL Id : hal-00874633 , version 1

Citer

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⟩

Collections

UNIV-PARIS1 CRI
125 Consultations
349 Téléchargements

Partager

Gmail Facebook X LinkedIn More