Parallel consistent labeling algorithms |
| |
Authors: | Ashok Samal Tom Henderson |
| |
Affiliation: | (1) Department of Computer Science, University of Utah, 84112 Salt Lake City, Utah, 84112 |
| |
Abstract: | Mackworth and Freuder have analyzed the time complexity of several constraint satisfaction algorithms.(1) Mohr and Henderson have given new algorithms, AC-4 and PC-3, for arc and path consistency, respectively, and have shown that the arc consistency algorithm is optimal in time complexity and of the same order space complexity as the earlier algorithms.(2) In this paper, we give parallel algorithms for solving node and arc consistency. We show that any parallel algorithm for enforcing are consistency in the worst case must have O(na) sequential steps, wheren is number of nodes, anda is the number of labels per node. We give several parallel algorithms to do arc consistency. It is also shown that they all have optimal time complexity. The results of running the parallel algorithms on a BBN Butterfly multiprocessor are also presented.This work was partially supported by NSF Grants MCS-8221750, DCR-8506393, and DMC-8502115. |
| |
Keywords: | Arc consistency parallel algorithms constraint satisfaction inherent parallelism |
本文献已被 SpringerLink 等数据库收录! |
|