A low power scheduling methodology under the timing constraints

Abstract

In this paper, an E-D-search-based algorithm is proposed to minimize power consumption with resources operating at multiple voltages under the timing constraints. The inputs to the algorithm consist of a data flow graph (DFG) representation of a circuit, the timing constraints, and a design library with fully characterized resources. Experimental results with a number of DSP benchmarks show that the algorithm can achieve significant power reduction.