Lower bounds on the power consumption in scheduled data flow graphs with resource constraints (poster paper)

Authors:
Lars Kruse;Eike Schmidt;Gerd Jochens;Ansgar Stammermann;Wolfgang Nebel
Affiliations:
OFFIS Research Institute, 26121 Oldenburg, Germany;OFFIS Research Institute, 26121 Oldenburg, Germany;OFFIS Research Institute, 26121 Oldenburg, Germany;OFFIS Research Institute, 26121 Oldenburg, Germany;OFFIS Research Institute, 26121 Oldenburg, Germany
Venue:
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Year:
2000

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Lower and upper bounds on the switching activity in scheduled data flow graphs

ISLPED '99 Proceedings of the 1999 international symposium on Low power electronics and design

A decade of reconfigurable computing: a visionary retrospective

Proceedings of the conference on Design, automation and test in Europe
Coarse grain reconfigurable architecture (embedded tutorial)

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Design-Space Exploration of Low Power Coarse Grained Reconfigurable Datapath Array Architectures

PATMOS '00 Proceedings of the 10th International Workshop on Integrated Circuit Design, Power and Timing Modeling, Optimization and Simulation

Hi-index	0.00