Performance of parallel consistency algorithms

Ashok Samal

doi:10.1007/BFb0038484

Performance of parallel consistency algorithms

Ashok Samal

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings
Editors	Naveed A. Sherwani, Elise de Doncker, John A. Kapenga
Publisher	Springer Verlag
Pages	132-138
Number of pages	7
ISBN (Print)	9780387976280
DOIs	https://doi.org/10.1007/BFb0038484
State	Published - 1991
Event	1st Great Lakes Computer Science Conference, 1989 - Kalamazoo, United States Duration: Oct 18 1989 → Oct 20 1989

Publication series

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

Other

Other	1st Great Lakes Computer Science Conference, 1989
Country/Territory	United States
City	Kalamazoo
Period	10/18/89 → 10/20/89

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/BFb0038484

Cite this

Samal, A. (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.
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 proceeding › Conference contribution

Samal, A 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 A. 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)). doi: 10.1007/BFb0038484

Samal, Ashok. / 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 = "Ashok Samal",

note = "Funding Information: paztia]ly supported by NSP Grants MCS-8221750, Publisher Copyright: {\textcopyright} Springer-Verlag New York Berlin Heidelberg 1991.; 1st Great Lakes Computer Science Conference, 1989 ; Conference date: 18-10-1989 Through 20-10-1989",

year = "1991",

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

N1 - Funding Information: paztia]ly supported by NSP Grants MCS-8221750, Publisher Copyright: © Springer-Verlag New York Berlin Heidelberg 1991.

PY - 1991

Y1 - 1991

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

T2 - 1st Great Lakes Computer Science Conference, 1989

Y2 - 18 October 1989 through 20 October 1989

ER -

Performance of parallel consistency algorithms

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this