Parallel and Distributed Finite Constraint Satisfaction: Complexity, Algorithms and Experiments

Authors:
Ying Zhang;Alan K. Mackworth
Affiliations:
-;-
Venue:
Parallel and Distributed Finite Constraint Satisfaction: Complexity, Algorithms and Experiments
Year:
1992

Citing 0
Cited 6

Chaotic iteration for distributed constraint propagation

Proceedings of the 1999 ACM symposium on Applied computing
CSPCONS: A Communicating Sequential Prolog with Constraints

SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
Communicating sequential processes for distributed constraint satisfaction

Information Sciences: an International Journal
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Autonomous dynamic reconfiguration in multi-agent systems: improving the quality and efficiency of collaborative problem solving

Autonomous dynamic reconfiguration in multi-agent systems: improving the quality and efficiency of collaborative problem solving
Solving collaborative fuzzy agents problems with CLP(FD)

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores the parallel complexity of finite constraint satisfaction problems (FCSPs) by developing three algorithms for deriving minimal constraint networks in parallel. The first is a parallel algorithm for the EREW PRAM model, the second is a distributed algorithm for fine-grain interconnected networks, and the third is a distributed algorithm for coarse-grain interconnected networks. Our major results are: given an FCSP represented by an acyclic constraint network (or a join tree) of size n with treewidth bounded by a constant, then (1) the parallel algorithm takes O(log n) time using O(n) processors, (2) there is an equivalent network, of size poly(n) with treewidth also bounded by a constant, which can be solved by the fine-grain distributed algorithm in O(\log n) time using poly(n) processors and (3) the distributed algorithm for coarse-grain interconnected networks has linear speedup and linear scaleup. In addition, we have simulated the fine-grain distributed algorithm based on the logical time assumption, experimented with the coarse-grain distributed algorithm on a network of transputers, and evaluated the results against the theory.