Title :
Energy complexity of optical computations
Author :
Tyagi, Akhilesh ; Reif, John
Author_Institution :
Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
Abstract :
The paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching upper bounds for a transitive function-shifting. Since the energy consumption in an optical transmission is a nonlinear function of the distance, a new setof techniques was required to derive these lower bounds. It also characterizes the energy requirements of 3-D VLSI computations
Keywords :
computational complexity; optical information processing; parallel algorithms; 3-D VLSI computations; distance; energy complexity; energy consumption; energy-time trade-off; lower bounds; nonlinear function; optical computations; optical transmission; transitive function; upper bounds; Computer science; Contracts; Costs; Energy consumption; Military computing; Nonlinear optics; Optical computing; Switches; Upper bound; Very large scale integration;
Conference_Titel :
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2087-0
DOI :
10.1109/SPDP.1990.143499
