Abstract

A general model for determining the computational efficiency of a particular class of electro-optical systems is described. The model is an abstraction of parallel systems that use digital electronic processors and optical pipelined buses for communication. Minimum requirements in terms of area (volume for three-dimensional structures) and time necessary in order to solve a problem are obtained. Different applications are investigated, and a matching area–time upper bound is given for the barrel-shift problem, simulated on an array with reconfigurable optical pipelined buses. The types of problems for which these lower bounds seem to be realistic are described.

© 1996 Optical Society of America

Parallel algorithms and architectures based on pipelined optical buses

Zicheng Guo and H. John Caulfield
Appl. Opt. 34(35) 8116-8124 (1995)

Resource requirements for digital computations on electrooptical systems

Mary M. Eshaghian, Dhabaleswar K. Panda, and V. K. Prasanna Kumar
Appl. Opt. 30(8) 928-935 (1991)

Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive

John H. Reif and Akhilesh Tyagi
Appl. Opt. 36(29) 7327-7340 (1997)

Comparison between electrical and free space optical interconnects for fine grain processor arrays based on interconnect density capabilities

Michael R. Feldman, Clark C. Guest, Timothy J. Drabik, and Sadik C. Esener
Appl. Opt. 28(18) 3820-3829 (1989)

Performance trade-offs for conventional lenses for free-space digital optics

D. T. Neilson and C. P. Barrett
Appl. Opt. 35(8) 1240-1248 (1996)