Performance of parallel consistency algorithms

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

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 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
Pages132-138
Number of pages7
ISBN (Print)9780387976280
DOIs
StatePublished - Jan 1 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

Other

Other1st Great Lakes Computer Science Conference, 1989
CountryUnited States
CityKalamazoo
Period10/18/8910/20/89

Fingerprint

Parallel algorithms
Labeling
Computer vision
Parallel Processors
Computer Vision
Time Complexity
Arc of a curve
Necessary

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Samal, A. K. (1991). Performance of parallel consistency algorithms. In N. A. Sherwani, E. de Doncker, & J. A. Kapenga (Eds.), Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings (pp. 132-138). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 507 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0038484

Performance of parallel consistency algorithms. / Samal, Ashok K.

Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings. ed. / Naveed A. Sherwani; Elise de Doncker; John A. Kapenga. Springer Verlag, 1991. p. 132-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 507 LNCS).

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

Samal, AK 1991, Performance of parallel consistency algorithms. in NA Sherwani, E de Doncker & JA Kapenga (eds), Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 507 LNCS, Springer Verlag, pp. 132-138, 1st Great Lakes Computer Science Conference, 1989, Kalamazoo, United States, 10/18/89. https://doi.org/10.1007/BFb0038484
Samal AK. Performance of parallel consistency algorithms. In Sherwani NA, de Doncker E, Kapenga JA, editors, Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings. Springer Verlag. 1991. p. 132-138. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0038484
Samal, Ashok K. / Performance of parallel consistency algorithms. Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings. editor / Naveed A. Sherwani ; Elise de Doncker ; John A. Kapenga. Springer Verlag, 1991. pp. 132-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9b3dbb1cac0b41d99ca930da77483f1d,
title = "Performance of parallel consistency algorithms",
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 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.",
author = "Samal, {Ashok K}",
year = "1991",
month = "1",
day = "1",
doi = "10.1007/BFb0038484",
language = "English (US)",
isbn = "9780387976280",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "132--138",
editor = "Sherwani, {Naveed A.} and {de Doncker}, Elise and Kapenga, {John A.}",
booktitle = "Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings",

}

TY - GEN

T1 - Performance of parallel consistency algorithms

AU - Samal, Ashok K

PY - 1991/1/1

Y1 - 1991/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=85030834748&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030834748&partnerID=8YFLogxK

U2 - 10.1007/BFb0038484

DO - 10.1007/BFb0038484

M3 - Conference contribution

AN - SCOPUS:85030834748

SN - 9780387976280

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 132

EP - 138

BT - Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings

A2 - Sherwani, Naveed A.

A2 - de Doncker, Elise

A2 - Kapenga, John A.

PB - Springer Verlag

ER -