Local register allocation (LRA) assigns pseudo-registers to actual registers in a basic block so as to minimize the spill cost. In this paper, four di#erent LRA algorithms are compared with respect to the quality of their generated allocations and the execution times of the algorithms themselves. The evaluation is based on a framework that views register allocation as the combination of boundary conditions, LRA, and register assignment. Our study does not address the problem of instruction scheduling in conjunction with register allocation, and we assume that the spill cost depends only on the number and type of load and store operations, but not on their positions within the instruction stream.

Data referencing during program execution can be a signicant source of energy consumption especially for data-intensive programs. In this paper, we propose an approach to minimize such energy consumption by allocating data to proper registers and memory. Through careful analysis of boundary conditions between consecutive blocks, our approach eÆciently handles various control structures including branches, merges and loops, and achieves the allocation results beneting the whole program. The computational cost for solving the allocation problem is rather low comparing with known approaches while the quality of the results are very encouraging. 1 Introduction Today's high demand of portable electronic products makes low energy consumption as important as high speed and small area in computer system design. Even for non-portable high performance systems, lower power consumption design helps to decrease packing and cooling cost and increase the reliability of the systems [25]. A lot of r...

An approach of doing register allocation beyond basic blocks for low energy is presented in this paper. With careful analysis of boundary conditions between consecutive blocks, our approach achieves the allocation results beneting the whole program. By doing the allocation block by block, we avoid excessive computational cost. 1 Introduction Today's high demand of portable electronic products makes low energy consumption as important as high speed and small area in computer system design. Even for non-portable high performance systems, lower power consumption design helps to decrease packing and cooling cost and increase the reliability of the systems [24]. A lot of research has been done in improving the power consumptions of various components in computer systems [8, 12, 18, 19, 24]. In particular, it is well recognized that access to dierent levels of storage components, such as register, cache, main memory and magnetic disk, diers dramatically in speed and power consumption [8,...

representing the official policies, either expressed or implied, of any sponsoring institution, the U.S. government or

Over the years, register allocation has been recognized as one of the vital problems to solve with respect to compiler design. Putting critical data values and/or addresses into the small but very fast memories that registers are, is essential for achieving high-speed code. This document gives an overview of the most important work in the field, detailing some breakthrough approaches while briefly mentioning a lot of results that where derived from them.