Kruse, Lars and Schmidt, Eike and von Cölln (Jochens), Gerd and Nebel, Wolfgang and Stammermann, Ansgar
This paper addresses the problem of solving the low power binding problem under resource constraints, i.e. binding operations and variables to resources such that power consumption of these resources is minimized. Three heuristics with different performance and quality of the produced bindings are presented. The best heuristic delivered the best possible binding in 55 out of 74 test cases while the other binding costs were within 5% of the optimum.
01 / 1999
PATMOS 1999, 9th International Workshop, 6-8 October 1999, Kos Island, Greece