Advertisement

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.

References

  1. 1.
    Alon, N.: Tools from higher algebra. In: Graham, R.L., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, vol. 2, pp. 1749–1783. MIT Press (1995)Google Scholar
  2. 2.
    Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: Complexity-theoretic obstacles to achieving energy savings with near-threshold computing. In: Proceedings of the 5th International Green Computing Conference (IGCC), pp. 1–8 (2014)Google Scholar
  3. 3.
    Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: Energy-efficient circuit design. In: Proceedings of the 5th conference on Innovations in Theoretical Computer Science (ITCS), pp. 303–312 (2014)Google Scholar
  4. 4.
    Butts, J., Sohim, G.: A static power model for architects. In: Proceedings of the 33rd Annual ACM/IEEE International Symposium on Microarchitecture (MICRO), pp. 191–201 (2000)Google Scholar
  5. 5.
    Dobrushin, R.L., Ortyukov, S.I.: Lower bound for the redundancy of self-correcting arrangements of unreliable functional elements. Probl. Inf. Transm. 13, 59–65 (1977)MATHGoogle Scholar
  6. 6.
    Dobrushin, R.L., Ortyukov, S.I.: Upper bound for the redundancy of self-correcting arrangements of unreliable functional elements. Probl. Inf. Transm. 13, 203–218 (1977)MATHGoogle Scholar
  7. 7.
    Dreslinski, R.G., Wieckowski, M., Blaauw, D., Sylvester, D., Mudge, T.N.: Near-threshold computing: Reclaiming Moore’s law through energy efficient integrated circuits. Proc. IEEE 98(2), 253–266 (2010)CrossRefGoogle Scholar
  8. 8.
    Gács, P.: Reliable Computation In: Algorithms in Informatics, vol. 2, ELTE Eötvös Kiadó, Budapest (2005)Google Scholar
  9. 9.
    Gács, P., Gál, A.: Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Trans. Inf. Theory 40(2), 579–583 (1994)CrossRefMATHGoogle Scholar
  10. 10.
    Kleitman, D.J., Leighton, F.T., Ma, Y.: On the design of reliable Boolean circuits that contain partially unreliable gates. J. Comput. Syst. Sci. 55(3), 385–401 (1997)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Palem, K.V.: Energy aware computing through probabilistic switching: A study of limits. IEEE Trans. Comput. 54(9), 1123–1137 (2005)CrossRefGoogle Scholar
  12. 12.
    Pippenger, N.: On networks of noisy gates. In: Proceedings of the 26th Symposium on Foundations of Computer Science (FOCS), pp. 30–38 (1985)Google Scholar
  13. 13.
    Pippenger, N., Stamoulis, G.D., Tsitsiklis, J.N.: On a lower bound for the redundancy of reliable networks with noisy gates. IEEE Trans. Inf. Theory 37(3), 639–643 (1991)CrossRefGoogle Scholar
  14. 14.
    Reischuk, R., Schmeltz, B.: Reliable computation with noisy circuits and decision trees-A general \(n \log n\) lower bound. In: Proceedings of the 32nd Symposium on Foundations of Computer Science (FOCS), pp. 602–611 (1991)Google Scholar
  15. 15.
    Shannon, C.E.: The synthesis of two-terminal switching circuits. Bell Syst. Tech. J. 28, 59–98 (1949)MathSciNetCrossRefGoogle Scholar
  16. 16.
    von Neumann, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 329–378. Princeton University Press (1956)Google Scholar

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