Performance of parallel consistency algorithms

Ashok Samal

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 algorlthms to enforce arc consistency, which has been shown to be inherently sequential[3, 6]. Since all three parallel algorithmq 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.

Original languageEnglish (US)
Title of host publicationComputing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings
EditorsNaveed A. Sherwani, Elise de Doncker, John A. Kapenga
PublisherSpringer Verlag
Number of pages7
ISBN (Print)9780387976280
StatePublished - 1991
Event1st Great Lakes Computer Science Conference, 1989 - Kalamazoo, United States
Duration: Oct 18 1989Oct 20 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume507 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other1st Great Lakes Computer Science Conference, 1989
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Performance of parallel consistency algorithms'. Together they form a unique fingerprint.

Cite this