Share Email Print

Optical Engineering

Programmable Optoelectronic Multiprocessors And Their Comparison With Symbolic Substitution For Digital Optical Computing
Author(s): F. Kiamilev; Sadik C. Esener; R. Paturi; Y. Fainmar; P. Mercier; C. C. Guest; Sing H. Lee
Format Member Price Non-Member Price
PDF $20.00 $25.00

Paper Abstract

This paper introduces programmable arrays of optically inter-connected electronic processors and compares them with conventional symbolic substitution (SS) systems. The comparison is made on the basis of computational efficiency, speed, size, energy utilization, programmability, and fault tolerance. The small grain size and space-invariant connections of SS lead to poor computational efficiency, difficult programming, and difficult incorporation of fault tolerance. Reliance on optical gates as its fundamental building elements is shown to give poor energy utilization. Programmable optoelectronic multiprocessor (POEM) systems, on the other hand, provide the architectural flexibility for good computational efficiency, use an energy-efficient combination of technologies, and support traditional programming methodologies and fault tolerance. Although the inherent clock speed of POEM systems is slower than that of SS systems, for most problems they will provide greater computational throughput. This comparison does not take into account the recent addition of crossover interconnect and space-variant masks to the SS architecture.

Paper Details

Date Published: 1 April 1989
PDF: 14 pages
Opt. Eng. 28(4) 284396 doi: 10.1117/12.7976967
Published in: Optical Engineering Volume 28, Issue 4
Show Author Affiliations
F. Kiamilev, University of California (United States)
Sadik C. Esener, University of California (United States)
R. Paturi, University of California (United States)
Y. Fainmar, University of California (United States)
P. Mercier, University of California (United States)
C. C. Guest, University of California (United States)
Sing H. Lee, University of California (United States)

© SPIE. Terms of Use
Back to Top