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

International Journal of Computational Science and Engineering

Volumn 1, Issue 2-4, 2005, Pages 192-206

  Habbas, Zineb ^a   Krajecki, Michaël ^b   Singer, Daniel ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

^b UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

Author keywords

constraint satisfaction problems; decomposition; OpenMP; parallel processing; shared memory

Indexed keywords

EID: 36248973472     PISSN: 17427185     EISSN: 17427193     Source Type: Journal    
DOI: 10.1504/ijcse.2005.009703     Document Type: Article

References (48)

1. Bacchus, F. and van Run, P. (1995) ‘Dynamic variable ordering in CSPs’, Proceedings of the First International Conference on Principles and Practice of Constraint Programming, Cassis, pp.258-274, Cassis, France.
2. Bessière, C. (1994) ‘Arc-consistency and arc-consistency again’, Artificial Intelligence, Vol. 65, pp.179-190.
3. Bessière, C., Freuder, E.C. and Régin, J-C. (1999) ‘Using constraint metaknowledge to reduce arc consistency computation’, Artificial Intelligence, Vol. 107, pp.125-148.
4. Bliek, C., Neveu, B. and Trombettoni, G. (1998) ‘Using graph decomposition for solving continuous csps’, Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming, CP’98 LNCS 1520, pp.102-116, Pisa, Italy.
5. Chmeiss, A. (1996) Réseaux de Contraintes: Algorithmes de Propagation et Dedécomposition, PhD dissertation, Université des Sciences et Techniques du Languedoc, Aix-Marseille I.
6. Conrad, J.M. and Agrawal, D.P. (1995) ‘Asynchronous parallel arc-consistency algorithms on distributed memory machine’, Journal of Parallel Distributed Computing, Vol. 24, pp.27-40.
7. Cooper, P.R. and Swain, M.J. (1992) ‘Arc consistency: parallelism and domain dependance’, Artificial Intelligence, Vol. 58, pp.207-235.
8. Crammond, J. (1991) ‘A comparative study of unification algorithms for OR-parallel execution of logic languages’, IEEE Transactions on Computers, Vol. C-34, No. 10, pp.911-917.
9. Debruyne, R. and Bessière, C. (1997) ‘Some practicable filtering techniques for the constraint satisfaction problem’, Proceedings of IJCAI’97, Nagoya, Japan, pp.412-417.
10. Dechter, R. (1990) ‘Enhancement schemes for constraint processing: back-jumping, learning and cutset decomposition’, Artificial Intelligence, Vol. 41, pp.273-312.
11. Dechter, R. and Pearl, J. (1989) ‘Tree clustering for constraint networks’, Artificial Intelligence, Vol. 38, pp.353-366.
12. Finkel, R. and Manber, U. (1987) ‘DIB – a distributed implementation of backtracking’, ACM Transactions on Programming Languages and Systems, Vol. 9, No. 2, pp.235-256.
13. Freuder, E.C. (1982) ‘A sufficient condition for backtrack-free search’, Journal of the Association for Computing Machinery, Vol. 29, pp.24-32.
14. Freuder, E.C. and Hubbe, P.D. (1995) ‘Extracting constraint satisfaction subproblems’, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal, pp.548-555.
15. Frost, D. and Dechter, R. (1995) ‘Look-ahead value ordering for constraint satisfaction problems’, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal, pp.572-578.
16. Gottlob, G., Leone, N. and Scarcello, F. (1999) ‘A comparison of structural csp decomposition methods’, Proceedings of IJCAI’99, pp.394-399, Stokholm, Swedan.
17. Güsgen, H-W., Ho, K. and Hilfinger, P.N. (1992) ‘A tagging method for parallel constraint satisfaction’, Journal of Parallel and Distributed Computing, Vol. 16, pp.72-75.
18. Habbas, Z., Herrmann, F., Mérel, P-P. and Singer, D. (1997) ‘Load balancing strategies for parallel forward search algorithm with conflict based back-jumping’, Proceedings of the International Conference on Parallel and Distributed Systems, Séoul, Korea.
19. Habbas, Z., Krajecki, M. and Singer, D. (2000) ‘Parallel resolution of CSP with OpenMP’, Proceedings of the second European Workshop on OpenMP, Edinburgh, Scotland, pp.1-8.
20. Habbas, Z., Krajecki, M. and Singer, D. (2001) ‘Shared memory implementation of constraint satisfaction problem resolution’, Parallel Processing Letters, Vol. 11, No. 4, pp.487-502.
21. Habbas, Z., Krajecki, M. and Singer, D. (2002) ‘Parallelizing Combinatorial Search in Shared Memory’, Proceedings of the Fourth European Workshop on OpenMP, Roma, Italy, Roma, Italy.
22. Hamadi, Y. (2001) ‘Interleaved backtracking in distributed constraint networks’, 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’01), Dallas, Texas, USA, pp.33-41.
23. Haralick, R.M. and Elliot, G.L. (1980) ‘Increasing the search efficiency for constraint satisfaction problems’, Artificial Intelligence, Vol. 14, pp.263-313.
24. Karp, R.M. and Zhang, Y. (1993) ‘Randomized parallel algorithms for backtrack search and Branch-and-Bound computation’, Journal of the Association for Computing Machinery, Vol. 40, No. 3, pp.765-789.
25. Kasif, S. (1989) ‘Parallel solutions to constraint satisfaction problems’, Proceedings of the first International Conference on Principles of Knowledge Representation and Reasoning, Toronto, pp.180-188.
26. Luo, Q.Y., Hendry, P.G. and Buchanan, J.T. (1992) ‘A new algorithm for dynamic distributed constraint satisfaction problems’, Proceedings of the Fifth Florida Artificial Intelligence Research Symposium, pp. 52-56, Ft. Lauderdale, Florida, USA.
27. Mackworth, A.K. (1977) ‘Consistency in networks of relations’, Artificial Intelligence, Vol. 8, pp.99-118.
28. Mérel, P-P. (1998) Les Problèmes de Satisfaction de Contraintes: Recherche N-aire et Parallélisme – Application au Placement en Cao, PhD dissertation, Université de Metz, France.
29. Miller, J.E. (1999) Longford’s Problem, Online: http://www.lclark.edu/miller/langford.html.
30. Montanari, U. (1974) ‘Networks of constraints: fundamental properties and applications to pictures processing’, Information Sciences, Vol. 7, pp.95-132.
31. Naganuma, J. and Ogura, T. (1994) ‘A highly OR-parallel inference machine (multi-ASCA) and its performance evaluation: an architecture and its load balancing algorithms’, IEEE Transaction on Computers, Vol. 43, No. 9, pp.1062-1075.
32. OpenMP (1997) C and C++ Application Program Interface, OpenMP Architecture Review Board, October, http://www.openmp.org.
33. Prestwitch, S. (1994) ‘On logic program parallelisation strategies’, Proceedings of Second International Workshop on Principles and Practice of Constraint Programming, LNCS 874, Rosario, Orcas Island, WA, pp.289-300.
34. Prosser, P. (1993) ‘Hybrid algorithms for the constraint satisfaction problem’, Computational Intelligence, Vol. 9, pp.268-299.
35. Prosser, P. (1994) ‘Binary constraint satisfaction problems: Some are harder than others’, Proceedings of the Eleventh European Conference on Artificial Intelligence, ECAI’94, Amsterdam, pp.95-99.
36. Rao, V.N. and Kumar, V. (1987) ‘Parallel depth first search. Part I. implementation’, International Journal of Parallel Programming, Vol. 16, No. 6, pp.479-499.
37. Ruiz-Andino, A., Araujo, L., Sàenz, F. and Ruz, J. (1999) ‘Parallel implementation of constraint solving’, Proceedings of the 5th International Conference PaCT-99, LNCS-1662, St. Petersbourg, Russia, pp.466-471.
38. Sabin, D. and Freuder, E.C. (1994) ‘Contradicting conventional wisdom in constraint satisfaction’, Proceedings of the eleventh European Conference on Artificial Intelligence, Amsterdam, pp.125-129.
39. Samal, A. and Henderson, T.C. (1987) ‘Parallel consistent labelling algorithms’, International Journal of Parallel Programming, Vol. 16, pp.341-364.
40. Smith, B. (2000) ‘Modelling a Permutation Problem’, Proceedings of ECAI’2000, Workshop on Modelling and Solving Problems with Constraints, RR 2000.18, available at http://www.dcs. st-and.ac.uk/apes/2000.html, Berlin.
41. Smith, B.M. (1994) ‘Phase transition and the mushy region in constraint satisfaction problems’, Proceedings of the Eleventh European Conference on Artificial Intelligence, pp.100-104, Amsterdam, The Netherlands.
42. Tarjan, R.E. and Yannakakis, M. (1984) ‘Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs’, Siam Journal of Computing, Vol. 13, pp.566-579.
43. Terrioux, C. (2001) ‘Recherche coopérative et nogood recording’, Proceedings of JFPLC, pp.173-188, Paris, France.
44. Walsh, T. (2001) Permutation Problems and Channelling Constraints, APES Research Group, Tech. Rep. APES-26-2001, January, available at http://www.dcs.st-and.ac.uk/apes/apesreports.html, http://www.dcs.st-and.ac.uk/~apes/reports/apes-26-2001.ps.gz.
45. Yokoo, M., Durfee, E.H., Ishida, T. and Kuwabara, K. (1992) ‘Distributed constraint satisfaction for formalizing distributed problem solving’, Proceedings of the 12th International Conference on Distributed Computing Systems (ICDCS-92), pp.614-622, Yokohama, Japan.
46. http://www.dcs.st-and.ac.uk/apes.
47. http://www.univ-reims.fr/Calculateur.
48. http://www.cines.fr