International Symposium on Mathematical Foundations of Computer Science

MFCS 2015: Mathematical Foundations of Computer Science 2015 pp 90-101

Almost All Functions Require Exponential Energy

  • Neal Barcelo
  • Michael Nugent
  • Kirk Pruhs
  • Michele Scquizzato
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9235)

Abstract

One potential method to attain more energy-efficient circuits with the current technology is Near-Threshold Computing, which means using less energy per gate by designing the supply voltages to be closer to the threshold voltage of transistors. However, this energy savings comes at a cost of a greater probability of gate failure, which necessitates that the circuits must be more fault-tolerant, and thus contain more gates. Thus achieving energy savings with Near-Threshold Computing involves properly balancing the energy used per gate with the number of gates used. The main result of this paper is that almost all Boolean functions require circuits that use exponential energy, even if allowed circuits using heterogeneous supply voltages. This is not an immediate consequence of Shannon’s classic result that almost all functions require exponential sized circuits of faultless gates because, as we show, the same circuit layout can compute many different functions, depending on the value of the supply voltages. The key step in the proof is to upper bound the number of different functions that one circuit layout can compute. We also show that the Boolean functions that require exponential energy are exactly the Boolean functions that require exponentially many faulty gates.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Neal Barcelo
    • 1
  • Michael Nugent
    • 1
  • Kirk Pruhs
    • 1
  • Michele Scquizzato
    • 2
  1. 1.Department of Computer ScienceUniversity of PittsburghPittsburghUSA
  2. 2.Department of Computer ScienceUniversity of HoustonHoustonUSA

Personalised recommendations