A Distributed Arc-Consistency Algorithm

Consistency techniques are an efficient way of tackling constraint satisfaction problems (CSP). In particular, various are-consistency algorithms have been designed such as the rime optimal AC-4 sequential algorithm of Mohr and Henderson (1986). In this paper, we present a new distributed are-consistency algorithm, called DisAC-4. DisAC-4 is based on AC-4, and is a coarse-grained parallel algorithm designed for distributed memory computers using message passing communication. Termination and correctness of the algorithm are proven. Theoretical complexities and experimental results are given. Both show linear speedup with respect to the number of processors. The strong point of DisAC-4 is its suitability to be implemented on very common hardware infrastructures like networks of workstations and/or PCs as well as on intensive computing parallel mainframes. (C) 1998 Elsevier Science B.V.

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

[2]  Gregory R. Andrews,et al.  Concurrent programming - principles and practice , 1991 .

[3]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[4]  Jack Dongarra,et al.  Pvm 3 user's guide and reference manual , 1993 .

[5]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[6]  Bernard A. Nadel,et al.  Constraint satisfaction algorithms 1 , 1989, Comput. Intell..

[7]  Ying Zhang,et al.  Parallel and distributed algorithms for finite constraint satisfaction problems , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[8]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

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

[10]  Charles J. Petrie,et al.  On the Equivalence of Constraint Satisfaction Problems , 1990, ECAI.

[11]  Simon Kasif,et al.  On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks , 1990, Artif. Intell..

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

[13]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[14]  Shmuel Katz,et al.  On the Feasibility of Distributed Constraint Satisfaction , 1991, IJCAI.

[15]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

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

[17]  Makoto Yokoo.  Constraint relaxation in distributed constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[18]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[19]  Patrick Henry Winston,et al.  The psychology of computer vision , 1976, Pattern Recognit..

[20]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..