Skip to main content
Springer Nature Link
Log in

Performance of parallel consistency algorithms

  • Track 3: Parallel Processing
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 507))

Included in the following conference series:

  • 110 Accesses

Abstract

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.

This work was done at the University of Utah and was partially supported by NSF Grants MSC-8221750, DCR-8506393, and DMC-8502115.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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.

    Article  Google Scholar 

  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. Alan K. Mackworth. Consistency in network of relations. Artificial Intelligence, 8:99–118, 1977.

    Article  MATH  Google Scholar 

  5. Roger Mohr and Thomas C. Henderson. Arc and path consitency revisited. Artificial Intelligence, 28(2):225–233, March 1986.

    Article  Google Scholar 

  6. Ashok Samal. Parallel Split-Level Relaxation. PhD thesis, Department Computer Science, University of Utah, August 1988.

    Google Scholar 

  7. Ashok Samal and Thomas C. Henderson. Parallel consistent labeling algorithms. International Journal of Parallel Programming, 16(5):341–364, 1988.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Nebraska, 68588, Lincoln, NE

    Ashok Samal

Authors
  1. Ashok Samal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Samal, A. (1991). Performance of parallel consistency algorithms. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038484

Download citation

  • DOI: https://doi.org/10.1007/BFb0038484

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics