Parallel algorithms based on expander graphs for optical computing

Ramamohan Paturi, Dau Tsuong Lu, Joseph E. Ford, Sadik Esener, Sing H. Lee

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

We consider the task of interconnecting processors to realize efficient parallel algorithms. We propose interconnecting processors using certain graphs called expander graphs, which can provide fast communication from any group of processors to the rest of the network. We show that these interconnections would result in a number of efficient parallel algorithms for sorting, routing, associative memory, and fault-tolerance networks. As the interconnections based on expander graphs are global and irregular, we reason that optical interconnections are preferred to electronic and propose implementation of these interconnections using the programmable optoelectronic multiprocessor architecture.

Original languageEnglish (US)
Pages (from-to)917-927
Number of pages11
JournalApplied Optics
Volume30
Issue number8
DOIs
StatePublished - Mar 10 1991
Externally publishedYes

Fingerprint

Optical data processing
Parallel algorithms
central processing units
Optical interconnects
Fault tolerance
Sorting
Optoelectronic devices
fault tolerance
Data storage equipment
associative memory
Communication
classifying
communication
electronics

Keywords

  • Expander graphs
  • Optical computing
  • Optical interconnection

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

Parallel algorithms based on expander graphs for optical computing. / Paturi, Ramamohan; Lu, Dau Tsuong; Ford, Joseph E.; Esener, Sadik; Lee, Sing H.

In: Applied Optics, Vol. 30, No. 8, 10.03.1991, p. 917-927.

Research output: Contribution to journalArticle

Paturi, Ramamohan ; Lu, Dau Tsuong ; Ford, Joseph E. ; Esener, Sadik ; Lee, Sing H. / Parallel algorithms based on expander graphs for optical computing. In: Applied Optics. 1991 ; Vol. 30, No. 8. pp. 917-927.
@article{dcf2284367904eab86173830a7384ee6,
title = "Parallel algorithms based on expander graphs for optical computing",
abstract = "We consider the task of interconnecting processors to realize efficient parallel algorithms. We propose interconnecting processors using certain graphs called expander graphs, which can provide fast communication from any group of processors to the rest of the network. We show that these interconnections would result in a number of efficient parallel algorithms for sorting, routing, associative memory, and fault-tolerance networks. As the interconnections based on expander graphs are global and irregular, we reason that optical interconnections are preferred to electronic and propose implementation of these interconnections using the programmable optoelectronic multiprocessor architecture.",
keywords = "Expander graphs, Optical computing, Optical interconnection",
author = "Ramamohan Paturi and Lu, {Dau Tsuong} and Ford, {Joseph E.} and Sadik Esener and Lee, {Sing H.}",
year = "1991",
month = "3",
day = "10",
doi = "10.1364/AO.30.000917",
language = "English (US)",
volume = "30",
pages = "917--927",
journal = "Applied Optics",
issn = "0003-6935",
publisher = "The Optical Society",
number = "8",

}

TY - JOUR

T1 - Parallel algorithms based on expander graphs for optical computing

AU - Paturi, Ramamohan

AU - Lu, Dau Tsuong

AU - Ford, Joseph E.

AU - Esener, Sadik

AU - Lee, Sing H.

PY - 1991/3/10

Y1 - 1991/3/10

N2 - We consider the task of interconnecting processors to realize efficient parallel algorithms. We propose interconnecting processors using certain graphs called expander graphs, which can provide fast communication from any group of processors to the rest of the network. We show that these interconnections would result in a number of efficient parallel algorithms for sorting, routing, associative memory, and fault-tolerance networks. As the interconnections based on expander graphs are global and irregular, we reason that optical interconnections are preferred to electronic and propose implementation of these interconnections using the programmable optoelectronic multiprocessor architecture.

AB - We consider the task of interconnecting processors to realize efficient parallel algorithms. We propose interconnecting processors using certain graphs called expander graphs, which can provide fast communication from any group of processors to the rest of the network. We show that these interconnections would result in a number of efficient parallel algorithms for sorting, routing, associative memory, and fault-tolerance networks. As the interconnections based on expander graphs are global and irregular, we reason that optical interconnections are preferred to electronic and propose implementation of these interconnections using the programmable optoelectronic multiprocessor architecture.

KW - Expander graphs

KW - Optical computing

KW - Optical interconnection

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

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

U2 - 10.1364/AO.30.000917

DO - 10.1364/AO.30.000917

M3 - Article

AN - SCOPUS:84975663915

VL - 30

SP - 917

EP - 927

JO - Applied Optics

JF - Applied Optics

SN - 0003-6935

IS - 8

ER -