Energy minimization using multiple supply voltages
Authors:
- M. PedramMPM. Pedram
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5 (4) , 157-162
Abstract
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both non-pipelined and functionally pipelined data-paths. The scheduling problem refers to the assignment of a supply voltage level to each operation in a data flow graph so as to minimize the average energy consumption for given computation time or throughput constraints or both. The energy model is accurate and accounts for the input pattern dependencies, re-convergent fanout induced dependencies, and the energy cost of level shifters. Experimental results show that using four supply voltage levels on a number of standard benchmarks, an average energy saving of 53% (with a computation time constraint of 1.5 times the critical path delay) can be obtained compared to using one fixed supply voltage level.Keywords
This publication has 9 references indexed in Scilit:
- Variable voltage scheduling1995
- Clustered voltage scaling technique for low-power design1995
- Computing the area versus delay trade-off curves in technology mappingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- A Monte Carlo approach for power estimationIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1993
- On the circuit implementation problemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- HYPER-LP: a system for power minimization using architectural transformations1992
- A model for estimating power dissipation in a class of DSP VLSI chipsIEEE Transactions on Circuits and Systems, 1991
- High-Level VLSI Synthesis1991
- Sehwa: a software package for synthesis of pipelines from behavioral specificationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988