Parallel and distributed algorithms for finite constraint satisfaction problems

This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we 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 sire n with width bounded by a constant then (1) the parallel algorithm takes O(1ogn) time using O ( n ) processors and (2) there is a mapping of this problem to a distributed computing network of poly(n) processors which stabilizes in O(1ogn) time.

• Type: Conference
• Year: 1991
• Where: SPDP
• Authors: Ying Zhang, Alan K. Mackworth
• Keywords: Algorithm, Constraint Satisfaction Problem, Distributed And Parallel Computing, Parallel Algorithm, SPDP 1991