Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study

This paper provides both a formal and an empirical study of decomposition techniques for parallel resolution of Constraint Satisfaction Problems (CSP) in shared memory. The main contribution of this study is to bring together decomposition techniques with Backtrack search to solve CSP on parallel architectures in shared memory. Another contribution is to demonstrate how to obtain good scalability up to hundreds of processors in shared memory for CSP resolution and more generally for Irregular Applications.

[1]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[2]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[3]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[4]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[5]  Patrick Prosser,et al.  Binary Constraint Satisfaction Problems: Some are Harder than Others , 1994, ECAI.

[6]  Toby Walsh,et al.  Permutation Problems and Channelling Constraints , 2001, LPAR.

[7]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[8]  Richard M. Karp,et al.  Randomized parallel algorithms for backtrack search and branch-and-bound computation , 1993, JACM.

[9]  Takeshi Ogura,et al.  A Highly OR-Parallel Inference Machine (Multi-ASCA) and Its Performance Evaluation: An Architecture and Its Load Balancing Algorithms , 1994, IEEE Trans. Computers.

[10]  Michael J. Swain,et al.  Arc Consistency: Parallelism and Domain Dependence , 1992, Artif. Intell..

[11]  Ashok Samal,et al.  Parallel consistent labeling algorithms , 1987, International Journal of Parallel Programming.

[12]  Cyril Terrioux.  Recherche coopérative et Nogood Recording , 2001, JFPLC.

[13]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[14]  Jim A. Crammond.  A comparative study of unification algorithms for OR-parallel execution of logic languages , 1985, IEEE Transactions on Computers.

[15]  Simon Kasif,et al.  Parallel solutions to constraint satisfaction problems (extended abstract) , 1989, KR 1989.

[16]  Barbara M. Smith,et al.  The Phase Transition and the Mushy Region in Constraint Satisfaction Problems , 1994, ECAI.

[17]  Yishai A. Feldman,et al.  Portability by automatic translation: a large-scale case study , 1999 .

[18]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[19]  Pierre-Paul Mérel.  Les problèmes de satisfaction de contraintes : recherche n-aire et parallélisme : application au placement en CAO , 1998 .

[20]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[21]  Vipin Kumar,et al.  Parallel depth first search. Part I. Implementation , 1987, International Journal of Parallel Programming.

[22]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[23]  Youssef Hamadi.  Interleaved backtracking in distributed constraint networks , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.

[24]  Gilles Trombettoni,et al.  Using Graph Decomposition for Solving Continuous CSPs , 1998, CP.

[25]  Zineb Habbas,et al.  Load balancing strategies for parallel forward search algorithm with conflict based backjumping , 1997, Proceedings 1997 International Conference on Parallel and Distributed Systems.

[26]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[27]  Michaël Krajecki,et al.  SHARED MEMORY IMPLEMENTATION OF CONSTRAINT SATISFACTION PROBLEM RESOLUTION , 2001 .

[28]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[29]  Dharma P. Agrawal,et al.  Asynchronous Parallel Arc Consistency Algorithms on a Distributed Memory Machine , 1995, J. Parallel Distributed Comput..

[30]  Christian Bessiere,et al.  Some Practicable Filtering Techniques for the Constraint Satisfaction Problem , 1997, IJCAI.

[31]  Rina Dechter,et al.  Look-Ahead Value Ordering for Constraint Satisfaction Problems , 1995, IJCAI.

[32]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[33]  Fahiem Bacchus,et al.  Dynamic Variable Ordering in CSPs , 1995, CP.

[34]  Steven David Prestwich.  On Logic Program Parallelisation Strategies , 1994, CONPAR.

[35]  Udi Manber,et al.  DIB—a distributed implementation of backtracking , 1987, TOPL.

[36]  Hans W. Guesgen,et al.  A Tagging Method for Parallel Constraint Satisfaction , 1992, J. Parallel Distributed Comput..

[37]  Eugene C. Freuder,et al.  Extracting Constraint Satisfaction Subproblems , 1995, IJCAI.