Parallel and distributed algorithms for finite constraint satisfaction problems
Ying Zhang, Alan K. Mackworth · 2002
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.>