Performance of parallel consistency algorithms

  • Ashok Samal
Track 3: Parallel Processing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 507)


Consistency algorithms are used to reduce the overall computation time for consistent labeling problem which is commonly used in computer vision. We have given parallel algorithms to enforce arc consistency, which has been shown to be inherently sequential[3,6]. Since all three parallel algorithms have the same time complexity on a PRAM, it is necessary to implement them on a parallel processor to determine which one performs best. The results of implementing them on a BBN Butterfly are presented here.


Random Graph Sequential Algorithm Parallel Processor Binary Constraint Cyclic Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    John Gaschnig. Performance Measurements and Analysis of Certain Search Algorithms. PhD thesis, Carnegie-Mellon University, Department of Computer Science, May 1979.Google Scholar
  2. [2]
    Robert M. Haralick and Linda G. Shapiro. The consistent labelling problem: Part I. IEEE Transactions On Pattern Analysis And Machine Intelligence, PAMI-1(2):173–184, April 1979.CrossRefGoogle Scholar
  3. [3]
    Simon Kasif. On the parallel complexity of some constraint satisfaction problems. In Proceedings of AAAI-86, pages 349–353. AAAI, August 11–15 1986.Google Scholar
  4. [4]
    Alan K. Mackworth. Consistency in network of relations. Artificial Intelligence, 8:99–118, 1977.zbMATHCrossRefGoogle Scholar
  5. [5]
    Roger Mohr and Thomas C. Henderson. Arc and path consitency revisited. Artificial Intelligence, 28(2):225–233, March 1986.CrossRefGoogle Scholar
  6. [6]
    Ashok Samal. Parallel Split-Level Relaxation. PhD thesis, Department Computer Science, University of Utah, August 1988.Google Scholar
  7. [7]
    Ashok Samal and Thomas C. Henderson. Parallel consistent labeling algorithms. International Journal of Parallel Programming, 16(5):341–364, 1988.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ashok Samal
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of NebraskaLincoln

Personalised recommendations