The widespread use of object-oriented languages and Internet security concerns are just the
beginning. Add embedded systems, multiple memory banks, highly pipelined units …

The recent advent of compute-intensive GPU architecture has allowed application
developers to explore high-order 3D stencils for better computational accuracy. A common …

The linear scan algorithm for register allocation provides a good register assignment with a
low compilation overhead and is thus frequently used for just-in-time compilers. Although …

We show that register allocation can be viewed as solving a collection of puzzles. We model
the register file as a puzzle board and the program variables as puzzle pieces; pre-coloring …

Static single assignment (SSA) form is an intermediate program representation in which
many code optimizations can be performed with fast and easy-to-implement algorithms …

Register allocation decides which parts of a variable's live range are held in registers and
which in memory. The compiler inserts spill code to move the values of variables between …

Interprocedural alias analyses often sacrifice precision for scalability. Thus, modern
compilers such as GCC and LLVM implement more scalable but less precise …

Graph coloring and linear scan are two appealing techniques for register allocation as the
underlying formalism are extremely clean and simple. This paper advocates a decoupled …

Finding the minimum register bank is an optimization problem related to the synthesis of
hardware. Given a program, the problem asks for the minimum number of registers plus their …

Compilers such as gcc use static-single-assignment (SSA) form as an intermediate
representation and usually perform SSA elimination before register allocation. But the order …