Parallel consistent labeling algorithms

Mackworth and Freuder have analyzed the time complexity of several constraint satisfaction algorithms.(1) Mohr and Henderson have given new algorithms, AC-4 and PC-3, for arc and path consistency, respectively, and have shown that the arc consistency algorithm is optimal in time complexity and of the same order space complexity as the earlier algorithms.(2) In this paper, we give parallel algorithms for solving node and arc consistency. We show that any parallel algorithm for enforcing are consistency in the worst case must have O(na) sequential steps, wheren is number of nodes, anda is the number of labels per node. We give several parallel algorithms to do arc consistency. It is also shown that they all have optimal time complexity. The results of running the parallel algorithms on a BBN Butterfly multiprocessor are also presented.

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

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

[3]  William A Kornfeld.  Using Parallel Processing for Problem Solving , 1979 .

[4]  Thomas C. Henderson,et al.  Parallel Split-Level Relaxation , 1988, Int. J. Pattern Recognit. Artif. Intell..

[5]  Walter J. Savitch,et al.  Time Bounded Random Access Machines with Parallel Processing , 1979, JACM.

[6]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[8]  Edsger W. Dijkstra,et al.  Co-operating sequential processes , 1968 .

[9]  William A. Kornfeld.  The Use of Parallelism to Implement a Heuristic Search , 1981, IJCAI.

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

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

[12]  Rina Dechter,et al.  A problem simplification approach that generates heuristics for constraint-satisfaction problems , 1988 .

[13]  Simon Kasif,et al.  On the Parallel Complexity of Some Constraint Satisfaction Problems , 1986, AAAI.

[14]  Peter Allmond Tinker.  The design and implementation of an or-parallel logic programming system , 1987 .

[15]  Michael J. Quinn,et al.  Parallel graph algorithms , 1984, CSUR.

[16]  Howard Jay Siegel,et al.  Parallel algorithm performance measures , 1982 .

[17]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[18]  Azriel Rosenfeld,et al.  Reduction operations for constraint satisfaction , 1978, Inf. Sci..

[19]  D. Knuth.  Estimating the efficiency of backtrack programs. , 1974 .