Abstract
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle constraints. Our approach eliminates the large power spikes, resulting in an increased battery lifetime, a property of utmost importance for battery powered embedded systems. Our approach extends the partial-clique partitioning algorithm by introducing power awareness through a heuristic algorithm which bounds the design space to those of power feasible schedules. We have applied our algorithm on a set of dataflow graphs and investigated the impact on circuit area when applying different power constraints.
Original language | English |
---|---|
Title of host publication | DATE 2003 |
Publisher | IEEE |
Publication date | 2003 |
Pages | 1136-1137 |
ISBN (Print) | 0-7695-1870-2 |
Publication status | Published - 2003 |
Event | 2003 Design, Automation and Test in Europe Conference and Exposition - Munich, Germany Duration: 3 Mar 2003 → 7 Mar 2003 http://www.informatik.uni-trier.de/~ley/db/conf/date/date2003.html |
Conference
Conference | 2003 Design, Automation and Test in Europe Conference and Exposition |
---|---|
Country/Territory | Germany |
City | Munich |
Period | 03/03/2003 → 07/03/2003 |
Internet address |