#### DMCA

## Analysis of Distributed Arc-Consistency Algorithms (1997)

### Cached

### Download Links

Citations: | 50 - 0 self |

### Citations

1195 | Distributed snapshots: determining global states of distributed systems
- CHANDY, LAMPORT
- 1985
(Show Context)
Citation Context ...= 0; timestamp := 0; 03 end. Figure 8: The DisAC-4 algorithm: The INITCOMCONTROLLER procedure. 5.3 The CONTROLLER process We may use a distributed snapshot algorithm as designed by Chandy and Lamport =-=[2]-=- to detect the end of the computations. By such an algorithm, a process in a distributed system determines a global state of the system during a computation. In our case, the process is the CONTROLLER... |

1137 |
Consistency in networks of relations
- Mackworth
- 1977
(Show Context)
Citation Context ... recognition and programming languages. We restricted ourselves to arc consistency. Many sequential algorithms have been designed to solve arc consistency: Waltz [16] filtering algorithm; Mackworth's =-=[6, 7]-=- AC-1, AC-2 and AC-3 algorithms; Mohr and Henderson's [8] AC-4 algorithm which is optimal in time complexity (AC-4 runs in O(n 2 d 2 ) where n is the number of variables, and d is the size of the larg... |

938 | Foundations of Constraint Satisfaction
- Tsang
- 1993
(Show Context)
Citation Context ...roof and its theoretical complexity are given in Section 5. Section 6 shows some experimental results. Finally, we state conclusions in Section 7. 2 Preliminaries Most of our notations are taken from =-=[13]-=-. Definition 1 A CSP is defined by a triplet (Z ; D; C) where: ffl Z is a finite set of variables fx 1 ; x 2 ; :::; x n g; ffl D is a function which associate to each variable x i a finite set of obje... |

432 | Understanding line drawings of scenes with shadows
- Waltz
(Show Context)
Citation Context ...ntelligence, image processing, pattern recognition and programming languages. We restricted ourselves to arc consistency. Many sequential algorithms have been designed to solve arc consistency: Waltz =-=[16]-=- filtering algorithm; Mackworth's [6, 7] AC-1, AC-2 and AC-3 algorithms; Mohr and Henderson's [8] AC-4 algorithm which is optimal in time complexity (AC-4 runs in O(n 2 d 2 ) where n is the number of ... |

290 | Distributed constraint satisfaction for formalizing distributed problem solving
- Yokoo, Durfee, et al.
- 1992
(Show Context)
Citation Context ... network; then they parallelized them and implemented them on a network of transputers [19, 20]. Numerous authors studied distributed backtracking algorithms for solving CSP. Yokoo and his colleagues =-=[18, 17]-=- formalize cooperative distributed problem solving (CDPS) as distributed constraint satisfaction problems (DCSP); they proposed distributed backtracking algorithms to solve DCSP. In [4], Collin and hi... |

288 |
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
- Mackworth, Freuder
- 1985
(Show Context)
Citation Context ... recognition and programming languages. We restricted ourselves to arc consistency. Many sequential algorithms have been designed to solve arc consistency: Waltz [16] filtering algorithm; Mackworth's =-=[6, 7]-=- AC-1, AC-2 and AC-3 algorithms; Mohr and Henderson's [8] AC-4 algorithm which is optimal in time complexity (AC-4 runs in O(n 2 d 2 ) where n is the number of variables, and d is the size of the larg... |

280 | Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition - Dechter - 1990 |

232 |
Arc and path consistency revisited
- Mohr, Henderson
- 1986
(Show Context)
Citation Context ...icient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the optimal AC-4 sequential algorithm of Mohr and Henderson =-=[8]-=-. In this paper, we present a new distributed arc-consistency algorithm, called DisAC-4. DisAC-4 is based on AC-4, and is a coarse-grained parallel algorithm designed for distributed memory computers ... |

212 | A generic arc-consistency algorithm and its specializations, Artif Intell. 57
- Hentenryck, Deville, et al.
- 1992
(Show Context)
Citation Context ...timal in time complexity (AC-4 runs in O(n 2 d 2 ) where n is the number of variables, and d is the size of the largest domain); AC-5, a generic algorithm, proposed by Van Henteryck, Deville and Teng =-=[15]-=-, which can exploits properties of particular classes of constraints, yielding an O(n 2 d) time complexity. When an arc-consistency algorithm has to distribute computing to a set of parallel processes... |

178 | Generating semantic descriptions from drawings of scenes with shadows.Technical Report AI271 - Waltz |

147 | Arc-consistency and arc-consistency again
- Bessière
- 1994
(Show Context)
Citation Context ...ermine the type of the content ofarg. 5 The distributed algorithm DisAC-4 5.1 The algorithm In DisAC-4 algorithm, we distribute the computation among p processes that we designate by Worker[1]� Worker=-=[2]-=-�:::�Worker[p]. They run the same code 8sprogram DisAC-4� process Worker[k :1::p] :: 01 begin 02 List := fg� Support h � i := fg� 03 j InitComWorker()� 04 j ToSendList := fg� 05 (* Step 1: Build suppo... |

127 |
Constraint satisfaction algorithms
- Nadel
- 1989
(Show Context)
Citation Context ...oes attack each other; the constraints are: C ij (v; w) j (v = w)s(ji \Gamma jj = jv \Gamma wj) Reverse N-queens provides a convenient test-bed for the constraint satisfaction algorithm than N-queens =-=[9]-=-. We call CS the benchmark used by Cooper and Swain in [3]. This CSP is defined by the following constraints: C ij (v; w) j :(jj \Gamma ij = 1sv ? w) Solving this CSP, AC-4 and DisAC-4 algorithms buil... |

93 | On the Equivalence of Constraint Satisfaction Problems
- Rossi, Petrie, et al.
- 1990
(Show Context)
Citation Context ...:::�vik to xi1�xi2�:::�xik variables do not transgress the constraint. In this paper, we restricts ourselves to binary CSPs. It is proven that every CSP can be transformed to an equivalent binary CSP =-=[10]-=-. A CSP (Z�D�C) is binary when constraints ofC are binary. Such a CSP may be associated to a directed graph. De nition 2 A binary CSP (Z�D�C) is associated toadirected graph as follows: (i) each varia... |

73 |
On the parallel complexity of discrete relaxation in constraint satisfaction networks
- Kasif
- 1990
(Show Context)
Citation Context ...llel AC-4 algorithm on the Connection Machine CM-2. The complexity is O(nd log(nd)) due to communication overheads. They also gave a massively parallel algorithm expressed as a digital circuit. Kasif =-=[5]-=- proved the inherent sequentiality of arc-consistent algorithms. It means that with a polynomial number of processors, one cannot expect less than a O(nd) time complexity. Zhang and Mackworth formulat... |

69 | On the feasibility of distributed constraint satisfaction
- Collin, Dechter, et al.
- 1991
(Show Context)
Citation Context ...is colleagues [18,17] formalize cooperative distributed problem solving (CDPS) as distributed constraint satisfaction problems (DCSP)� they proposed distributed backtracking algorithms to solveDCSP.In=-=[4]-=-,Collinand his colleagues examines the possibility of using uniform model of computation to design self-stabilizing distributed backtracking algorithms. In an uniform model of computation, all the pro... |

41 | Parallel and distributed algorithms for finite constraint satisfaction problems
- Zhang, Mackworth
- 1991
(Show Context)
Citation Context ... arcs correspond to variables and nodes to constraints. They explored algorithms to compute consistency of such a network; then they parallelized them and implemented them on a network of transputers =-=[19, 20]-=-. Numerous authors studied distributed backtracking algorithms for solving CSP. Yokoo and his colleagues [18, 17] formalize cooperative distributed problem solving (CDPS) as distributed constraint sat... |

32 |
Concurrent Programming: Principles and Practice. The Benjamin/Cummings Publishing Company
- Andrews
- 1991
(Show Context)
Citation Context ...r. Because channels are FIFO queues, messages are received in the order they have been sent. Many different notations have been proposed for asynchronous message passing. We use notations proposed in =-=[1]-=-. A parallel program is composed of processes which run concurrently and share global variables. program ANEXAMPLE; global variables declaration PROC 1 :: Body of PROC 1 process PROC 2 :: Body of PROC... |

27 |
Hentenryck, Constraint Satisfaction in Logic Progrumming
- Van
- 1989
(Show Context)
Citation Context ...ributed memory computers, as found on very common hardwares such as networks of workstations and/or PCs. As arc-consistency has important applications in constraint logic programming over nite domain =-=[14,15]-=-, weintend to investigate how a parallel arc-consistency algorithm could be part of a parallel constraint logic programming language for nite domains. Acknowledgments The authors thank the anonymous r... |

19 | Constraint relaxation in distributed constraint satisfaction problems
- Yokoo
- 1993
(Show Context)
Citation Context ... network; then they parallelized them and implemented them on a network of transputers [19, 20]. Numerous authors studied distributed backtracking algorithms for solving CSP. Yokoo and his colleagues =-=[18, 17]-=- formalize cooperative distributed problem solving (CDPS) as distributed constraint satisfaction problems (DCSP); they proposed distributed backtracking algorithms to solve DCSP. In [4], Collin and hi... |

14 | Parallel and distributed finite constraint satisfaction: Complexity, algorithms and experiments
- Zhang, Mackworth
- 1994
(Show Context)
Citation Context ... arcs correspond to variables and nodes to constraints. They explored algorithms to compute consistency of such a network; then they parallelized them and implemented them on a network of transputers =-=[19, 20]-=-. Numerous authors studied distributed backtracking algorithms for solving CSP. Yokoo and his colleagues [18, 17] formalize cooperative distributed problem solving (CDPS) as distributed constraint sat... |

12 |
Parallel consistent labeling algorithms
- Samal, Henderson
- 1987
(Show Context)
Citation Context ... to access data structures and to exchange results of their local computation. A first natural way is to use a shared memory. Several authors followed this shared memory approach. Henderson and Samal =-=[12]-=- proposed parallel versions of AC-1, AC-3 and AC-4 algorithms for shared memory parallel computers. A theoretical study shows that the parallel version of AC-4 with nd processors runs in O(nd). They i... |

9 | Consistent labeling problems and their algorithms: Expected complexities and theory-based heuristics - Nudel - 1983 |

8 |
Arc consistency: parallelism and domain dependence
- Cooper, Swain
- 1992
(Show Context)
Citation Context ...thms on a BBN Butterfly multiprocessor. Since using nd processors is unrealistic, they used k processors, and experimented a linear speedup (that is O( n 2 d 2 k )) on their example. Cooper and Swain =-=[3]-=- implemented and experimented a similar parallel AC-4 algorithm on the Connection Machine CM-2. The complexity is O(nd log(nd)) due to communication overheads. They also gave a massively parallel algo... |

5 |
National Laboratory. \ PVM - 3 Users guide and Reference Manual
- Ridge
- 1993
(Show Context)
Citation Context ...e performance. More communications generate more parallelism but also more overhead. 6 Experimental results We have implemented DisAC-4 on Sun workstations connected to an Ethernet local network. PVM =-=[11]-=- provides us a distributed message passing programming environment which is widely used in intensive parallel computing. PVM proposes tools which allow asynchronous message passing operations as descr... |

2 |
On the Equivalence of Constraint Satisfaction
- Rossi, Petrie, et al.
- 1990
(Show Context)
Citation Context ... i 1 ; x i 2 ; :::; x i k variables do not transgress the constraint. 2 In this paper, we restricts ourselves to binary CSP. It is proven that every CSP can be transformed to an equivalent binary CSP =-=[10]-=-. A CSP (Z ; D; C) is binary when constraints of C are binary. Such a CSP may be associated to a directed graph. Definition 2 A binary CSP (Z ; D; C) is associated to a directed graph G as follows: (i... |

1 |
On the Feasibility
- Collin, Dechter, et al.
- 1991
(Show Context)
Citation Context ...olleagues [18, 17] formalize cooperative distributed problem solving (CDPS) as distributed constraint satisfaction problems (DCSP); they proposed distributed backtracking algorithms to solve DCSP. In =-=[4]-=-, Collin and his colleagues examines the possibility of using uniform model of computation within all the processing agents are indistinguishable to design self-stabilizing distributed backtracking al... |

1 |
Parallel Consistent Labeling Algorithms, Int
- Samal, Henderson
- 1987
(Show Context)
Citation Context ... they have to access data structures and exchange results of their local computation. A rst natural way istouseasharedmemory. Several authors followed this shared memory approach. Henderson and Samal =-=[12]-=- proposed parallel versions of AC-1, AC-3 and AC-4 algorithms for shared memory parallel computers. A theoretical study shows that the parallel version of AC-4 with nd processors runs in O(nd). They i... |

1 |
Parallel and distributed algorithms for nite constraint satisfaction problems
- Zhang, Mackworth
- 1991
(Show Context)
Citation Context ...orrespond to variables and nodes to constraints. They explored algorithms to compute consistency of such a network. They parallelized these algorithms and implemented them on a network of transputers =-=[19,20]-=-. Numerous authors studied distributed backtracking algorithms for solving CSP.Yokoo and his colleagues [18,17] formalize cooperative distributed problem solving (CDPS) as distributed constraint satis... |

1 | A parallel architecture for constraint satisfaction - Gu, Sosic - 1991 |