Download:
|
by C Fl Ying Zhang, Ying Zhang, Ying Zhang, Alan K. Mackworth, Alan K. Mackworth, Alan K. Mackworth
ftp://ftp.cs.ubc.ca/ftp/local/techreports/1992/TR-92-30.ps.gz
Add To MetaCart
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.
Citations
|
877
|
Consistency in networks of relations
– Mackworth
- 1977
|
|
739
|
Constraint Networks
– Dechter
- 1992
|
|
369
|
Parallel Database Systems: The future of high performance database systems
– DeWitt, Gray
- 1992
|
|
354
|
Networks of constraints: Fundamental properties and applications to picture processing
– Montanari
- 1974
|
|
345
|
The Theory of Relational Databases
– Maier
- 1983
|
|
281
|
Parallel algorithms for shared-memory machines
– Karp, Ramachandran
- 1990
|
|
260
|
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
– Mackworth, Freuder
- 1985
|
|
243
|
Constraint Satisfaction
– Mackworth
- 1987
|
|
233
|
Synthesizing constraint expressions
– Freuder
- 1978
|
|
186
|
Graph rewriting: An algebraic and logic approach
– Courcelle
- 1990
|
|
165
|
Distributed constraint satisfaction for formalizing distributed problem solving
– Yokoo, Durfee, et al.
- 1992
|
|
113
|
Parallel tree contraction and its applications
– Miller, Reif
- 1985
|
|
88
|
A simple parallel tree contraction algorithm
– Abrahamson, Dadoun, et al.
- 1989
|
|
56
|
Complexity of k-tree structured constraint satisfaction problems
– Freuder
- 1990
|
|
50
|
On the parallel complexity of discrete relaxation in constraint satisfaction networks
– Kasif
- 1990
|
|
40
|
Classes of graphs with bounded treewidth
– Bodlaender
- 1988
|
|
32
|
Parallel and distributed algorithms for finite constraint satisfaction problems
– Zhang, Mackworth
|
|
27
|
NC-algorithms for graphs with small treewidth
– Bodlaender
- 1988
|
|
13
|
A sufficient Condition for Backtrack Free Search
– Freuder
- 1982
|
|
10
|
Parallel Object Recognition from Structure
– Cooper
- 1989
|
|
10
|
Timetable construction - an annotated bibliography
– Schmidt, Strohlein
- 1979
|
|
7
|
A distributed solution to the network consistency problem
– Collin, Dechter
- 1990
|
|
6
|
Connectionist networks for constraint satisfaction
– Guesgen
- 1991
|
|
6
|
Exact solution in linear time of networks of constraints using perfect relaxation
– Rossi, Montanari
- 1989
|
|
6
|
Local computation in hypertrees
– Shafer, Shenoy
- 1988
|
|
4
|
Parallel and distributed algorithms for constraint networks
– Zhang, Mackworth
- 1991
|
|
3
|
Parallel and distributed constraint satisfaction: Complexity, algorithms and experiments
– Zhang, Mackworth
- 1993
|
|
1
|
Easy problems for tree-decomposable graphs. Journal of Algorithms, 12:308 -- 340
– Arnborg, Lagergren
- 1991
|
|
1
|
Performance of an asynchronous parallel algorithm on a generic multiprocessor simulator
– Conrad, Agrawal
- 1991
|
