Register Allocation and Binding for Low Power

This paper describes a technique for calculating the switching activity of a set of registers shared by dierent data values. Based on the assumption that the joint pdf (probability density function) of the primary input random variables is known or that a suciently large number of input vectors has been given, the register assignment problem for minimum power consumption is formulated as a minimum cost clique covering of an appropriately dened compatibility graph (which is shown to be transitively orientable). The problem is then solved optimally (in polynomial time) using a max-cost ow algorithm. Experimental results conrm the viability and usefulness of the approach in minimizing power consumption during the register assignment phase of the behavioral synthesis process.

• Type: Conference
• Year: 1995
• Where: DAC
• Authors: Jui-Ming Chang, Massoud Pedram
• Keywords: Computer Architecture, DAC 1995, Power Consumption, Register Assignment, Register Assignment Problem