By Topic

Lower bounds on the power consumption in scheduled data flow graphs with resource constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Kruse, L. ; OFFIS Res. Inst., Oldenburg, Germany ; Schmidt, E. ; Jochens, G. ; Stammermann, A.
more authors

Summary form only given. 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 is addressed. The estimated bound takes into account the effects of resource sharing. It is shown that by introducing Langrangian multipliers and relaxing the low power binding problem to the Assignment Problem, which can be solved in O(n 3), a tight and fast computable bound is achievable. Experimental results show the good quality of the bound. In most cases, deviations smaller than 5% from the optimal binding were observed. The proposed technique can for example be applied in branch and bound high-level synthesis algorithms for efficient pruning of the design space

Published in:

Design, Automation and Test in Europe Conference and Exhibition 2000. Proceedings

Date of Conference:

2000