Highly parallel consistent labeling algorithm suitable for optoelectronic implementation

Gary C. Marsden, Fouad Kiamilev, Sadik Esener, Sing H. Lee

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Constraint satisfaction problems require a search through a large set of possibilities. Consistent labeling is a method by which search spaces can be drastically reduced. We present a highly parallel consistent labeling algorithm, which achieves strong k-consistency for any value k and which can include higher-order constraints. The algorithm uses vector outer product, matrix summation, and matrix intersection operations. These operations require local computation with global communication and, therefore, are well suited to a optoelectronic implementation.

Original languageEnglish (US)
Pages (from-to)185-194
Number of pages10
JournalApplied Optics
Volume30
Issue number2
DOIs
StatePublished - Jan 10 1991
Externally publishedYes

Fingerprint

Optoelectronic devices
Labeling
marking
Constraint satisfaction problems
matrices
intersections
communication
Communication
products

Keywords

  • Consistent labeling
  • Constraint satisfaction
  • Optoelectronic computing
  • Parallel algorithm

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

Highly parallel consistent labeling algorithm suitable for optoelectronic implementation. / Marsden, Gary C.; Kiamilev, Fouad; Esener, Sadik; Lee, Sing H.

In: Applied Optics, Vol. 30, No. 2, 10.01.1991, p. 185-194.

Research output: Contribution to journalArticle

Marsden, Gary C. ; Kiamilev, Fouad ; Esener, Sadik ; Lee, Sing H. / Highly parallel consistent labeling algorithm suitable for optoelectronic implementation. In: Applied Optics. 1991 ; Vol. 30, No. 2. pp. 185-194.
@article{84f77682cc584944be2d54423428a757,
title = "Highly parallel consistent labeling algorithm suitable for optoelectronic implementation",
abstract = "Constraint satisfaction problems require a search through a large set of possibilities. Consistent labeling is a method by which search spaces can be drastically reduced. We present a highly parallel consistent labeling algorithm, which achieves strong k-consistency for any value k and which can include higher-order constraints. The algorithm uses vector outer product, matrix summation, and matrix intersection operations. These operations require local computation with global communication and, therefore, are well suited to a optoelectronic implementation.",
keywords = "Consistent labeling, Constraint satisfaction, Optoelectronic computing, Parallel algorithm",
author = "Marsden, {Gary C.} and Fouad Kiamilev and Sadik Esener and Lee, {Sing H.}",
year = "1991",
month = "1",
day = "10",
doi = "10.1364/AO.30.000185",
language = "English (US)",
volume = "30",
pages = "185--194",
journal = "Applied Optics",
issn = "0003-6935",
publisher = "The Optical Society",
number = "2",

}

TY - JOUR

T1 - Highly parallel consistent labeling algorithm suitable for optoelectronic implementation

AU - Marsden, Gary C.

AU - Kiamilev, Fouad

AU - Esener, Sadik

AU - Lee, Sing H.

PY - 1991/1/10

Y1 - 1991/1/10

N2 - Constraint satisfaction problems require a search through a large set of possibilities. Consistent labeling is a method by which search spaces can be drastically reduced. We present a highly parallel consistent labeling algorithm, which achieves strong k-consistency for any value k and which can include higher-order constraints. The algorithm uses vector outer product, matrix summation, and matrix intersection operations. These operations require local computation with global communication and, therefore, are well suited to a optoelectronic implementation.

AB - Constraint satisfaction problems require a search through a large set of possibilities. Consistent labeling is a method by which search spaces can be drastically reduced. We present a highly parallel consistent labeling algorithm, which achieves strong k-consistency for any value k and which can include higher-order constraints. The algorithm uses vector outer product, matrix summation, and matrix intersection operations. These operations require local computation with global communication and, therefore, are well suited to a optoelectronic implementation.

KW - Consistent labeling

KW - Constraint satisfaction

KW - Optoelectronic computing

KW - Parallel algorithm

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

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

U2 - 10.1364/AO.30.000185

DO - 10.1364/AO.30.000185

M3 - Article

AN - SCOPUS:84975634778

VL - 30

SP - 185

EP - 194

JO - Applied Optics

JF - Applied Optics

SN - 0003-6935

IS - 2

ER -