Embarrassingly Parallel Search

  title={Embarrassingly Parallel Search},
  author={Jean-Charles R{\'e}gin and Mohamed Rezgui and Arnaud Malapert},
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, for instance 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… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS
35 Citations
19 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 35 extracted citations

54 Citations

Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 19 references

Epstein . A hybrid paradigm for adaptive parallel search

  • Peter Zoeteweij, Farhad Arbab.
  • 2012

Davenport . Massively parallel constraint programming for supercomputers : Challenges and initial results

  • Xi Yun, L. Susan
  • 2010

Stuckey . Confidencebased work stealing in parallel constraint programming

  • Geoffrey Chu, Christian Schulte, J. Peter
  • 2009

Similar Papers

Loading similar papers…