Parallel consistent labeling algorithms

Journal Article · Thu Oct 01 00:00:00 EDT 1987 · Int. J. Parallel Program.; (United States)

DOI:https://doi.org/10.1007/BF01407901· OSTI ID:6231811

Samal, A; Henderson, T

Mackworth and Freuder have analyzed the time complexity of several constraint satisfaction algorithms. 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. In this paper, they give parallel algorithms for solving node and arc consistency. They show that any parallel algorithm for enforcing arc consistency in the worst case must have O(na) sequential steps, where n is number of nodes, and a is the number of labels per node. They 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.

• Research Organization: Univ. of Utah, Salt Lake City (USA)
• OSTI ID: 6231811
• Journal Information: Int. J. Parallel Program.; (United States), Journal Name: Int. J. Parallel Program.; (United States) Vol. 16:5; ISSN IJPPE
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER CODES
CONSTRAINTS
DATA PROCESSING
DATA TRANSMISSION
EFFICIENCY
FUNCTIONS
ITERATIVE METHODS
MATHEMATICAL LOGIC
MEMORY DEVICES
PARALLEL PROCESSING
PERFORMANCE
PROCESSING
PROGRAMMING
TASK SCHEDULING