Lower bounds on the power consumption in scheduled data flow graphs with resource constraints
Kruse, Lars and Schmidt, Eike and von Cölln (Jochens), Gerd and Stammermann, Ansgar and Nebel, Wolfgang
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. The estimated bound takes into account the effects of resource sharing. It is shown that by introducing Lagrangian multipliers and relaxing the low power binding problem to the Assignment Problem, which can be solved in O(n3), a tight and fast computable bound is achievable. Experimental results show the good quality of the bound. In most cases
01 / 2000
inproceedings
DATE 2000, Design, Automation and Test in Europe: Conference and Exhibition 2000, Paris, France, March 27-30, - Los Alamitos, Calif.: IEEE
PEOPLE
Power Estimation for fast Exploration of Embedded Systems
Power Estimation for fast Exploration of Embedded Systems
OFFIS Autoren
