Skip to Main content Skip to Navigation
Conference papers

Improvement of the Embarrassingly Parallel Search for Data Centers

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

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01344078
Contributor : Jean-Charles Regin <>
Submitted on : Monday, July 11, 2016 - 12:26:54 PM
Last modification on : Thursday, March 5, 2020 - 12:20:24 PM
Document(s) archivé(s) le : Wednesday, October 12, 2016 - 12:13:24 PM

File

EPS_cp2014.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

174

Files downloads

432