Parallel and distributed algorithms for finite constraint satisfaction problems

Authors:
Ying Zhang; Mackworth
Affiliations:
Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada;Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada
Venue:
SPDP '91 Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed Processing
Year:
1991

Citing 0
Cited 2

Consistency Maintenance for ABT

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Asynchronous aggregation and consistency in distributed constraint satisfaction

Artificial Intelligence - Special issue: Distributed constraint satisfaction

Quantified Score

Hi-index	0.00

Visualization

Abstract

The authors develop two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, they give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. If an FCSP can be represented by an acyclic constraint network of size n with width bounded by a constant then: the parallel algorithm takes O(log n) time using O(n) processors and there is a mapping of this problem to a distributed computing network of poly(n) processors which stabilizes in O(log n) time.