Parallélisme en programmation par contraintes

Mohamed Rezgui 1
1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe CEP
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
Abstract : We study the search procedure parallelization in Constraint Programming (CP). After giving an overview on various existing methods of the state-of-the-art, we present a new method, named Embarrassinqly Parallel Search (EPS). This method is based on the decomposition of a problem into many disjoint subproblems which are then solved in parallel by computing units with little or without communication. The principle of EPS is to have a resolution times balancing for each computing unit in a statistical sense to obtain a goodDépôt de thèse – Données complémentaireswell-balanced workload. We assume that the amount of resolution times of all subproblems is comparable to the resolution time of the entire problem. This property is checked with CP and allows us to have a simple and efficient method in practice. In our experiments, we are interested in enumerating all solutions of a problem, and proving that a problem has no solution and finding an optimal solution of an optimization problem. We observe that the decomposition has to generate at least 30 subproblems per computing unit to get equivalent workloads per computing unit. Then, we evaluate our approach on different architectures (multicore machine, cluster and cloud computing) and we observe a substantially linear speedup. A comparison with current methods such as work stealing or portfolio shows that EPS gets better results.
Document type :
Theses
Complete list of metadatas

Cited literature [80 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01191760
Contributor : Abes Star <>
Submitted on : Wednesday, September 2, 2015 - 2:54:19 PM
Last modification on : Monday, November 5, 2018 - 3:48:02 PM
Long-term archiving on : Wednesday, April 26, 2017 - 2:26:12 PM

File

2015NICE4040.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01191760, version 1

Collections

Citation

Mohamed Rezgui. Parallélisme en programmation par contraintes. Autre [cs.OH]. Université Nice Sophia Antipolis, 2015. Français. ⟨NNT : 2015NICE4040⟩. ⟨tel-01191760⟩

Share

Metrics

Record views

605

Files downloads

1141