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 is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alan K. Mackworth and Eugene C. Freuder, The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems,Artificial Intelligence 25(1):65–74 (January 1985).
Roger Mohr and Thomas C. Henderson, Arc and Path Consistency Revisited,Artificial Intelligence 28(2):225–233 (March 1986).
Alan K. Mackworth, Consistency in Network of Relations,Artificial Intelligence 8:99–118, (1977).
Ugo Montanari, Networks of Constraints: Fundamental Properties and Applications to Picture Processing,Information Sciences 7:95–132 (1974).
Donald E. Knuth, Estimating the Efficiency of Backtrack Programs,Mathematics of Computation 29(129):121–136 (January 1975).
John Gaschnig,Performance Measurements and Analysis of Certain Search Algorithms, PhD thesis, Carnegie-Mellon University, Department of Computer Science (May 1979).
Robert M. Haralick, Larry S. Davis, Azriel Rosenfeld, and David Milgram, Reduction Operations for Constraint Satisfaction,Information Sciences 14:199–219 (1978).
Azriel Rosenfeld, Robert A. Hummel, and Steven W. Zucker, Scene Labelling by Relaxation Operations,IEEE Transactions On Systems, Man, And Cybernetics, SMC 6(6):420–433 (June 1976).
Michael J. Quinn and Narsingh Deo, Parallel Graph Algorithms,Computing Surveys,16(3):319–348 (September 1984).
Walter J. Savitch and Michael J. Stimson, Time Bounded Random Access Machines with Parallel Processing,Journal of the Association for Computing Machinery 26(1):103–118 (January 1979).
BBN Laboratories Inc.,Butterfly Parallel Processor Overview, Report Number 6148 (March 1986).
E. W. Dijkstra, Co-operating Sequential Processes, InProgramming Languages, NATO Advanced Study Institute, F. Genuys, ed., Chapter 2, Academic Press, pp. 43–112 (1968).
Ashok Samal, Segmentation and Classification in a Multiprocessor Environment, Ph.D. Dissertation Proposal (December 1986).
Leah J. Siegel, Howard Jay Siegel, and Phillip H. Swain,Parallel Algorithm Performance Measures, Academic Press, New York, pp. 241–252 (1982).
Thomas C. Henderson and Ashok Samal, Parallel Split-Level Relaxation,International Journal of Pattern Recognition and Artificial Intelligence, to appear (1988).
William A. Kornfeld,The Use of Parallelism to Implement a Heuristic Search, Technical Report A.I. Memo No. 627, MIT, MIT AI Lab (March 1981).
William A. Kornfeld,Using Parallel Processing for Problem Solving, Technical Report A.I. Memo No. 561, MIT, MIT AI Lab (December 1979).
Rina Dechter and Judea Pearl,A Problem Simplification Approach that Generates Heuristics for Constraint Gatisfaction Problems, Technical Report UCLA-ENG-REP-8497, UCLA (1986).
Simon Kasif, On the Parallel Complexity of Some Constraint Satisfaction Problems, InProceedings of AAAI-86, AAAI, pp. 349–353 (August 1986).
Charles L. Seitz, The Cosmic Cube,Communications of the ACM 28(1):22–23 (January 1985).
Sequent Computer Systems, Inc.,BALANCE 8000 Guide to Parallel Programming (1985).
Peter Tinker,The Design and Implementation of an OR-Parallel Logic Programming System, PhD thesis, Department of Computer Science, University of Utah (1987).
BBN Laboratories Inc.,The Butterfly RAMFile System, Report Number 6351 (September 1986).
BBN Laboratories Inc.,Chrysalis Programmers Manual Version 2.3.1. BBN Report Number 6191 (August 1986).
Author information
Authors and Affiliations
Additional information
This work was partially supported by NSF Grants MCS-8221750, DCR-8506393, and DMC-8502115.
Rights and permissions
About this article
Cite this article
Samal, A., Henderson, T. Parallel consistent labeling algorithms. Int J Parallel Prog 16, 341–364 (1987). https://doi.org/10.1007/BF01407901
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01407901