N. Aggoun-1993-]-abderrahmane-aggoun and . Beldiceanu, Extending CHIP in order to solve complex scheduling and placement problems, Mathematical and Computer Modelling, vol.17, issue.7, pp.57-73, 1993.

]. G. Almasi and A. Gottlieb, Highly Parallel Computing, 1989.

]. Amadini, M. Gabbrielli, and J. Mauro, An Empirical Evaluation of Portfolios Approaches for Solving CSPs, 2012.
DOI : 10.1007/978-3-642-38171-3_21
URL : https://hal.archives-ouvertes.fr/hal-00909297

J. Mikhail and . Atallah, Algorithms and theory of computation handbook, 2002.

P. Baptiste and C. L. Pape, Edge-R finding constraint propagation algorithms, Proc. of the ECAI workshop on Intelligent Scheduling of Production Processes, 1996.

]. Beck, P. Prosser, and R. Wallace, Trying Again to Fail-First, Recent Advances in Constraints, pp.41-55, 2005.
DOI : 10.1007/11402763_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2098

N. Beldiceanu and E. Contejean, Introducing global constraints in CHIP, Mathematical and Computer Modelling, vol.20, issue.12, pp.97-123, 1994.
DOI : 10.1016/0895-7177(94)90127-9
URL : https://hal.archives-ouvertes.fr/hal-00442810

C. Bessière and J. Régin, Arc Consistency for General Constraint Networks: Preliminary Results, Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97 Volumes, pp.398-404, 1997.

]. C. Bessière and J. Régin, Refining the Basic Constraint Propagation Algorithm, Proceedings of IJCAI'01, pp.309-315, 2001.

A. Biere, M. Heule, H. Van-maaren, and T. Walsh, Conflict-driven clause learning SAT solvers. Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, pp.131-153, 2009.

E. Guy, C. E. Blelloch, . Leiserson, M. Bruce, G. Maggs et al., An experimental analysis of parallel sorting algorithms, Theory of Computing Systems, vol.31, issue.2, pp.135-167, 1998.

]. Bordeaux, Y. Hamadi, and H. Samulowitz, Experiments with Massively Parallel Constraint Solving, pp.443-448, 2009.

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting Systematic Search by Weighting Constraints, Proceedings of the 16 th Eureopean Conference on Artificial Intelligence, ECAI'2004, including Prestigious Applicants of Intelligent Systems, PAIS, pp.146-150, 2004.

]. Burton and M. R. Sleep, Executing functional programs on a virtual tree of processors, Proceedings of the 1981 conference on Functional programming languages and computer architecture , FPCA '81, pp.187-194, 1981.
DOI : 10.1145/800223.806778

N. Capit, G. D. Costa, Y. Georgiou, G. Huard, C. Martin et al., A batch scheduler with high level components, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005., pp.776-783, 2005.
DOI : 10.1109/CCGRID.2005.1558641
URL : https://hal.archives-ouvertes.fr/hal-00005106

C. Cérin, J. Dubacq, and J. Roch, Methods for partitioning data to improve parallel execution time for sorting on heterogeneous clusters, Advances in Grid and Pervasive Computing, pp.175-186, 2006.

C. K. Kenil, H. C. Cheng-et-roland, and . Yap, An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints, Constraints, vol.15, issue.2, pp.265-304, 2010.

G. Chu, C. Schulte, and P. J. Stuckey, Confidence-Based Work Stealing in Parallel Constraint Programming, In Ian P. Gent Lecture Notes in Computer Science, vol.39, pp.226-241, 2009.
DOI : 10.1007/978-3-540-30201-8_41

]. A. Colmerauer, An introduction to Prolog III, Communications of the ACM, vol.33, issue.7, pp.69-90, 1990.
DOI : 10.1145/79204.79210

M. Gérard-cornuéjols, Y. Karamanov, and . Li, Early Estimates of the Size of Branch-and-Bound Trees, INFORMS Journal on Computing, vol.18, issue.1, pp.86-96, 2006.
DOI : 10.1287/ijoc.1040.0107

]. R. Dechter, From local to global consistency, Artificial Intelligence, vol.55, issue.1, pp.87-107, 1992.
DOI : 10.1016/0004-3702(92)90043-W

A. Dollas, T. William, D. Rankin, and . Mccracken, A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler, Cité en page 105, pp.379-382, 1998.
DOI : 10.1109/18.651068

]. Ezzahir, C. Bessiere, M. Belaissaoui, and H. Bouyakhf, DisChoco: A platform for distributed constraint programming, Proceedings of the IJCAI, pp.16-21, 2007.
URL : https://hal.archives-ouvertes.fr/lirmm-00189778

]. Fischetti, M. Monaci, and D. Salvagnin, Self-splitting of Workload in Parallel Computation, CPAIOR'14, pp.2014-76, 2014.
DOI : 10.1007/978-3-319-07046-9_28

G. Gabriel, G. Fagg, T. Bosilca, J. Angskun, J. Dongarra et al., Andrew Lumsdaineet al. Open MPI: Goals, Concept, and Design of a next generation MPI Bibliography implementation, Recent Advances in Parallel Virtual Machine and Message Passing Interface, pp.97-104, 2004.

I. Gent and T. Walsh, CSPlib: A Benchmark Library for Constraints, Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming, CP '99, pp.480-481, 1999.
DOI : 10.1007/978-3-540-48085-3_36

C. Gomes and B. Selman, Algorithm Portfolio Design: Theory vs. Practice, Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence, pp.190-197, 1997.

C. Gomes and B. Selman, Search strategies for hybrid search spaces, Proceedings 11th International Conference on Tools with Artificial Intelligence, pp.359-364, 1999.
DOI : 10.1109/TAI.1999.809823

C. Gomes and B. Selman, HYBRID SEARCH STRATEGIES FOR HETEROGENEOUS SEARCH SPACES, International Journal on Artificial Intelligence Tools, vol.09, issue.01, pp.45-57, 2000.
DOI : 10.1142/S0218213000000057

C. Gomes and B. Selman, Algorithm portfolios, Artificial Intelligence, vol.126, issue.1-2, pp.43-62, 2001.
DOI : 10.1016/S0004-3702(00)00081-3

W. Gropp and E. Lusk, The MPI communication library: its design and a portable implementation, Proceedings of Scalable Parallel Libraries Conference, pp.160-165, 1993.
DOI : 10.1109/SPLC.1993.365571

]. Halstead, Implementation of multilisp, Proceedings of the 1984 ACM Symposium on LISP and functional programming , LFP '84, pp.9-17, 1984.
DOI : 10.1145/800055.802017

R. Haralick and G. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

J. Marijn, O. Heule, S. Kullmann, A. Wieringa, and . Biere, Cube and conquer: Guiding CDCL SAT solvers by lookaheads, Hardware and Software: Verification and Testing, pp.50-65, 2012.

]. Hyde, Java thread programming, 1999.

]. Jaffar, A. E. Santosa, R. H. Yap, . Kenny-qili, and . Zhu, Scalable distributed depth-first search with greedy work stealing, 16th IEEE International Conference on Tools with Artificial Intelligence, pp.98-103, 2004.
DOI : 10.1109/ICTAI.2004.107

P. Kilby, J. K. Slaney, S. Thiébaux, and T. Walsh, Estimating Search Tree Size, AAAI, pp.1014-1019, 2006.

D. Steve-kleiman, B. Shah, and . Smaalders, Programming with threads, pp.48-81, 1996.

E. Donald and . Knuth, Estimating the efficiency of backtrack program, Mathematics of Computation, vol.29, pp.121-136, 1975.

]. Kowalski, Algorithm = logic + control, Communications of the ACM, vol.22, issue.7, pp.424-436, 1979.
DOI : 10.1145/359131.359136

]. Krishna, P. Balaji, E. Lusk, R. Thakur, and F. Tiller, Implementing MPI on Windows: Comparison with Common Approaches on Unix, Recent Advances in the Message Passing Interface, pp.160-169, 2010.
DOI : 10.1007/978-3-642-15646-5_17

]. Laurière, Un langage et un programme pour énoncer et résoudre des problèmes combinatoires, 1976.

]. Laurière, A language and a program for stating and solving combinatorial problems, Artificial Intelligence, vol.10, issue.1, pp.29-127, 1978.
DOI : 10.1016/0004-3702(78)90029-2

C. Lecoutre, C. Likitvivatanavong, and R. Yap, A pathoptimal GAC algorithm for table constraints, 20th European Conference on Artificial Intelligence (ECAI'12), pp.510-515, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00873051

]. Lester, The art of parallel programming, pp.48-49, 1993.

]. Li, Introduction to windows azure, 2009.
DOI : 10.1007/978-1-4302-2470-9

A. Michael-luby, D. Sinclair, and . Zuckerman, Optimal speedup of Las Vegas algorithms, Information Processing Letters, vol.47, issue.4, pp.173-180, 1993.
DOI : 10.1016/0020-0190(93)90029-9

]. Machado, V. Pedro, and S. Abreu, On the Scalability of Constraint Programming on Hierarchical Multiprocessor Systems, 2013 42nd International Conference on Parallel Processing, pp.530-535, 2013.
DOI : 10.1109/ICPP.2013.66

]. Mccarthy, EPISTEMOLOGICAL PROBLEMS OF ARTIFICIAL INTELLIGENCE, Proceedings of the Fifth International Joint Conference on Artificial Intelligence, pp.1038-1044, 1977.
DOI : 10.1016/B978-0-934613-03-3.50035-0

. Tarek-menouer-et-bertrand-le-cun, Adaptive N To P Portfolio for Solving Constraint Programming Problems on Top of the Parallel Bobpp Framework, 2014 IEEE 28 th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, pp.63-76, 2014.

M. Tarek-menouer, B. L. Rezgui, J. Cun, and . Régin, Mixing Static and Dynamic Partitionning to Parallelize a Constraint Programming Solver, High-level Parallel Programming and Applications (HLPP), 2014.

M. Tarek-menouer, B. L. Rezgui, J. Cun, and . Régin, Mixing Static and Dynamic Partitionning to Parallelize a Constraint Programming Solver, In International Journal of Parallel Programming, pp.2015-2024, 2015.

]. Michel, A. See, and P. Van-hentenryck, Transparent Parallelization of Constraint Programming, INFORMS Journal on Computing, vol.21, issue.3, pp.363-382, 2009.
DOI : 10.1287/ijoc.1080.0313

C. Barton-miller, S. Macrander, and . Sechrest, A distributed programs monitor for Berkeley UNIX. Software: Practice and Experience, pp.183-200, 1986.

]. Mohr, C. Thomas, and . Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
DOI : 10.1016/0004-3702(86)90083-4
URL : https://hal.archives-ouvertes.fr/inria-00548487

]. Mohr and G. Masini, Good Old Discrete Relaxation, ECAI, pp.651-656, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00548479

N. Nethercote, P. J. Stuckey, R. Becket, S. Brand, G. J. Duck et al., MiniZinc: Towards a Standard CP Modelling Language, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, CP'07, pp.529-543, 2007.
DOI : 10.1007/978-3-540-74970-7_38

E. Mahony, A. Hebrard, C. Holland, . Nugent, O. Barry et al., Using case-based reasoning in an algorithm portfolio for constraint solving, Irish Conference on Artificial Intelligence and Cognitive Science, pp.210-216, 2008.

]. Perez and J. Régin, Improving GAC-4 for Table and MDD Constraints, Principles and Practice of Constraint Programming -20th International Conference, CP 2014, pp.606-621, 2014.
DOI : 10.1007/978-3-319-10428-7_44
URL : https://hal.archives-ouvertes.fr/hal-01344079

]. Rashid, An inter-process communication facility for UNIX, 1980.

P. Refalo, Impact-Based Search Strategies for Constraint Programming, Mark Wallace, editeur, Principles and Practice of Constraint Programming , 10th International Conference, pp.557-571, 2004.
DOI : 10.1007/978-3-540-30201-8_41

]. Régin, A filtering algorithm for constraints of difference in CSPs, AAAI94, pp.362-367, 1994.

J. Régin, M. Rezgui, and A. Malapert, Improvement of the Embarrassingly Parallel Search for Data Centers, Principles and Practice of Constraint Programming, pp.622-635, 2014.
DOI : 10.1007/978-3-319-10428-7_45

M. Rezgui, J. Régin, and A. Malapert, Une adaptation simple et efficace du modèle MapReduce pour la programmation par contraintes, 9èmes Journées Francophones de Programmation par Con- traintes(JFPC'14), 2013.

J. Mohamed-rezgui, A. Régin, and . Malapert, Adaptation de la méthode Embarrassingly Parallel Search pour un centre de calcul, 10èmes Journées Francophones de Programmation par Contraintes(JFPC'14), 2014.

J. Mohamed-rezgui, A. Régin, and . Malapert, Using Cloud Computing for Solving Constraint Programming Problems, First Workshop on Cloud Computing and Optimization, p.2014, 2014.

]. Rossi, C. J. Petrie, and V. Dhar, On the Equivalence of Constraint Satisfaction Problems, ECAI, vol.90, pp.550-556, 1990.

S. Peter and S. Winkel, Super scalar sample sort, Algorithms?ESA 2004, pp.784-796, 2004.

C. Schulte and . Schulte, Gecode: Generic Constraint Development Environment, 2006.

M. Barbara, K. Smith, T. Stergiou, and . Walsh, Modelling the Golomb Ruler Problem, IJCAI-99 Workshop on Non-Binary Constraints. International Joint Conference on Artificial IntelligenceCité en page 105, 1999.

R. Julian and . Ullmann, Partition search for non-binary constraint satisfaction, Information Sciences, vol.177, issue.18, pp.3639-3678, 2007.

D. Tak, . Peter-van-der-tak, J. Marijn, A. Heule, and . Biere, Concurrent cube-and-conquer, Theory and Applications of Satisfiability Testing?SAT 2012, pp.475-476

M. Wahbi, R. Ezzahir, C. Bessiere, . El-houssine, and . Bouyakhf, DisChoco 2: A platform for distributed constraint reasoning, Proceedings of DCR, pp.112-121, 2011.

]. D. Waltz and M. Ma, Understanding Line Drawings of Scenes with Shadows In The Psychology of Computer Vision, pp.19-91, 1972.

]. B. Wilkinson and M. Allen, Parallel Programming: Techniques and Application Using Networked Workstations and Parallel Computers, pp.31-32, 2005.

]. Xie and A. Davenport, Massively Parallel Constraint Programming for Supercomputers: Challenges and Initial Results, CPAIOR, pp.334-338, 2010.
DOI : 10.1007/978-3-642-13520-0_36

]. Xu, F. Hutter, H. Hoos, and K. Leyton-brown, SATzilla: Portfolio-based Algorithm Selection for SAT, J. Artif. Int. Res, vol.32, pp.565-606, 2008.

T. Durfee, K. Ishida, and . Kuwabara, The Distributed Constraint Satisfaction Problem: Formalization and Algorithms, IEEE Transactions on Knowledge and Data Engineering, vol.10, pp.673-685, 1998.

]. Zhang, H. Roland, and . Yap, Making AC-3 an optimal algorithm, IJCAI, pp.316-321, 2001.

P. Zoeteweij and F. Arbab, A Component-Based Parallel Constraint Solver, Lecture Notes in Computer Science, vol.11, issue.4, pp.307-322, 2004.
DOI : 10.1145/952532.952605