Abstract
We show a lower bound of Ω(I 2(n)) on the energy-time product ET for a function with the information complexity I(n) both in uniswitch and multiswitch energy models. However the multiswitch circuits can be shown to be more energy efficient than the uniswitch circuits. We show a lower bound of Ω(I 2(n)) on the uniswitch energy and a lower bound of Ω(I 3/2(n)) on the multiswitch energy. The matching upper bounds can be shown to exist for several functions.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, A. K. Chandra, and P. Raghavan. Energy Consumption in VLSI Circuits. In ACM Symposium on Theory of Computing, pages 205–216, ACM-SIGACT, 1988.
G. M. Baudet. On the Area Required by VLSI Circuits. In Proceedings of CMU Conference on VLSI, pages 100–107, CMU, Computer Science Press, 1981.
R.P. Brent and H.T. Kung. The Chip Complexity of Binary Arithmetic. In ACM Symposium on Theory of Computing, ACM-SIGACT, 1980.
R. Bennett and R. Landauer. Fundamental Physical Limits of Computation. Scientific American, July 1985.
J. Ja'Ja' and V.K. Kumar. Information Transfer in Distributed Computing with Applications to VLSI. Journal of the ACM, January 1984.
G. Kissin. Measuring Energy Consumption in VLSI Circuits: a Foundation. In ACM Symposium on Theory of Computing, ACM-SIGACT, 1982.
G. Kissin. Functional Bounds on Switching Theory. In Chapel Hill Conference on VLSI, U.N.C., Chapel Hill, Computer Science Press, 1985.
G. Kissin. Measuring Energy Consumption in VLSI Circuits. PhD thesis, Department of Computer Science, University of Toronto, Toronto, 1987.
T. Lengauer and K. Mehlhorn. On the Complexity of VLSI Computations. In Proceedings of CMU Conference on VLSI, CMU, Computer Science Press, 1981.
C. Mead and L. Conway. Introduction to VLSI Systems. Addison-Wesley, Reading, Mass., 1980.
M. S. Paterson, W. L. Ruzzo, and L. Snyder. Bounds on Minimax Edge Length for Complete Binary Trees. In ACM Symposium on Theory of Computing, ACM-SIGACT, 1981.
C. Papadimitriou and M. Sipser. Communication Complexity. In ACM Symposium on Theory of Computing, ACM-SIGACT, 1982.
C. L. Seitz, A. H. Frey, S. Mattisson, S. D. Rabin, D. A. Speck, and Van de Snepscheut J. Hot-Clock nMOS. In Chapel Hill Conference on VLSI, U.N.C., Chapel Hill, Computer Science Press, 1985.
L. Snyder and A. Tyagi. The Energy Complexity of Transitive Functions. Technical Report TRCS-86-09-07, Dept. of Computer Science, University of Washington, Seattle, 1986. A preliminary version appears in the Proceedings of the Twenty-fourth Annual Allerton Conference on Communication, Control and Computing, 1986.
C.D. Thompson. Area-Time Complexity for VLSI. In ACM Symposium on Theory of Computing, ACM-SIGACT, 1979.
C. D. Thompson. A Complexity Theory for VLSI. PhD thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, 1980.
A. Tyagi. The Role of Energy in VLSI Computations. PhD thesis, Department of Computer Science, University of Washington, Seattle, 1988. Available as UWCS Technical Report Number 88-06-05.
J.D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, Md., 1984.
J. Vuillemin. A Combinatorial Limit to the Computing Power of VLSI Circuits. IEEE Transactions on Computers, 294–300, March 1983.
A.C. Yao. Some Complexity Questions Related to Distributed Computing. In ACM Symposium on Theory of Computing, ACM-SIGACT, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tyagi, A. (1989). Energy-time trade-offs in VLSI computations. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_52
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive