Improvement of the Embarrassingly Parallel Search for Data Centers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Improvement of the Embarrassingly Parallel Search for Data Centers

Résumé

We propose an adaptation of the Embarrassingly Parallel Search (EPS) method for data centers. EPS is a simple but efficient method for parallel solving of CSPs. EPS decomposes the problem in many distinct subproblems which are then solved independently by workers. EPS performed well on multi-cores machines (40), but some issues arise when using more cores in a datacenter. Here, we identify the decomposition as the cause of the degradation and propose a parallel decomposition to address this issue. Thanks to it, EPS gives almost linear speedup and outperforms work stealing by orders of magnitude using the Gecode solver.
Fichier principal
Vignette du fichier
EPS_cp2014.pdf (339.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01344078 , version 1 (11-07-2016)

Identifiants

Citer

Jean-Charles Régin, Mohamed Rezgui, Arnaud Malapert. Improvement of the Embarrassingly Parallel Search for Data Centers. CP 2014, Sep 2014, Lyon, France. ⟨10.1007/978-3-319-10428-7_45⟩. ⟨hal-01344078⟩
115 Consultations
261 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More