Towards an energy complexity of computation
Energy consumption is becoming a critical complexity parameter along with time (delay) in the design and optimization of algorithms at both the hardware and software levels. This paper proposes that a new complexity measure including energy E and time t in the form of the expression E x t(2) be used as the measure of the efficiency of a computation. We prove that the metric is optimal. As an example, a new result concerning the optimal length of a pipeline is derived. (C) 2001 Elsevier Science B.V. All rights reserved.
energy complexity energy consumption pipelining vlsi integrated circuits cmos power consumption energy-delay product