Area-time trade-offs in arrays with optical pipelined buses.

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.