On the Power Consumption of Digital Computing Systems;

Abstract

In this paper, the predictability of power consumption of digital computing systems is investigated by using the abstract Turing machine model which is known to be a universal computer. An upper bound for power consumption of such machine model is defined. Also, a polynomial-time algorithm that can automatically produce a two-tape Turing machine which can record power consumption of an arbitrarily given standart Turing machine, is developed. ©2005 IEEE.