17 search results - page 4 / 4 » A Fast 5 2-Approximation Algorithm for Hierarchical Scheduli... |
ISSS
2000
IEEE
13 years 9 months ago
2000
IEEE
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. T...
MICRO
2003
IEEE
13 years 10 months ago
2003
IEEE
Large instruction window processors achieve high performance by exposing large amounts of instruction level parallelism. However, accessing large hardware structures typically req...