Embarrassingly Parallel Search

Abstract : We propose the Embarrassingly Parallel Search, a simple and efficient method for solving constraint programming problems in parallel. We split the initial problem into a huge number of independent subproblems and solve them with available workers (i.e., cores of machines). The decomposition into subproblems is computed by selecting a subset of variables and by enumerating the combinations of values of these variables that are not detected inconsistent by the propagation mechanism of a CP Solver. The experiments on satisfaction problems and on optimization problems suggest that generating between thirty and one hundred subproblems per worker leads to a good scalability. We show that our method is quite competitive with the work stealing approach and able to solve some classical problems at the maximum capacity of the multi-core machines. Thanks to it, a user can parallelize the resolution of its problem without modifying the solver or writing any parallel source code and can easily replay the resolution of a problem.
Type de document :
Communication dans un congrès
19th International Conference on Principles and Practice of Constraint Programming (CP 2013), Sep 2013, Uppsala, Sweden. Principles and Practice of Constraint Programming - 19th International Conference, 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, 2013, <10.1007/978-3-642-40627-0_45>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01344074
Contributeur : Jean-Charles Regin <>
Soumis le : lundi 11 juillet 2016 - 12:21:36
Dernière modification le : mercredi 20 juillet 2016 - 10:01:51
Document(s) archivé(s) le : mercredi 12 octobre 2016 - 12:00:17

Fichier

EmbarPara.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Jean-Charles Régin, Mohamed Rezgui, Arnaud Malapert. Embarrassingly Parallel Search. 19th International Conference on Principles and Practice of Constraint Programming (CP 2013), Sep 2013, Uppsala, Sweden. Principles and Practice of Constraint Programming - 19th International Conference, 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, 2013, <10.1007/978-3-642-40627-0_45>. <hal-01344074>

Partager

Métriques

Consultations de
la notice

58

Téléchargements du document

99