Energy complexity of optical computations

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 fun...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel and Distributed Processing, 2nd IEEE Symposium On S. 14 - 21
Hauptverfasser: Tyagi, A., Reif, J.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE Comput. Soc. Press 1990
Schlagworte:
ISBN:0818620870, 9780818620874
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.< >
ISBN:0818620870
9780818620874
DOI:10.1109/SPDP.1990.143499