Effective graph theoretic techniques for the generalized low power binding problem

Authors:
Azadeh Davoodi;Ankur Srivastava
Affiliations:
University of Maryland, College Park, MD;University of Maryland, College Park, MD
Venue:
Proceedings of the 2003 international symposium on Low power electronics and design
Year:
2003

Citing 5
Cited 4

Register allocation and binding for low power

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
MediaBench: a tool for evaluating and synthesizing multimedia and communicatons systems

MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
Estimation of lower and upper bounds on the power consumption from scheduled data flow graphs

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low power electronics and design
A super-scheduler for embedded reconfigurable systems

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Predictability: definition, ananlysis and optimization

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design

Peak temperature control and leakage reduction during binding in high level synthesis

ISLPED '05 Proceedings of the 2005 international symposium on Low power electronics and design
Thermal-induced leakage power optimization by redundant resource allocation

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Unification of scheduling, binding, and retiming to reduce power consumption under timings and resources constraints

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Power-driven simultaneous resource binding and floorplanning: a probabilistic approach

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.03

Visualization

Abstract

This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First the generalized low power binding problem is formulated as an Integer Linear Programming(ILP) problem which happens to be an NP-complete task to solve. Then two polynomial-time heuristics are proposed that provide a speedup of up to 13.7 with an extremely low penalty for power when compared to the optimal ILP solution for our selected benchmarks.