A Game-Theoretic Approach for Binding in Behavioral Synthesis
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
A low power scheduler using game theory
Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
A game theoretic approach for power optimization during behavioral synthesis
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.01 |
This paper proposes a new technique for power optimization during high level synthesis. Specifically, we present a floorplan based Combined Register And Module assignment algorithm, CREAM, for synthesizing low power datapath circuits. The algorithm accepts a scheduled data flow graph and assigns operations to functional units and variables to registers. The operations which have common inputs and are capable of reducing power by mapping to the same functional unit are identified. Further, variables are assigned to registers in such a manner that the unwanted or spurious computations are minimized. During variable assignment, that particular register is selected (based on the floorplan) which has a smaller interconnect length between itself and the functional unit. This optimizes the interconnect power. CREAM has been applied to some high level synthesis benchmarks and the results obtained indicate that power savings up to 43% with an area increase of up to 5.0% is achieved.