Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 52 for “"Register allocation"”.
-
Register allocation via graph coloring
… IBM in Yorktown Heights built the first global register allocator based on graph coloring. This thesis describes a series of improvements and extensions to the Yorktown allocator. There are four primary results: (1) Optimistic coloring. Chaitin's coloring heuristic pessimistically assumes any …
-
Combined instruction scheduling and register allocation
… the phases of instruction scheduling and register allocation can be disaffected phases. Negative effects can be detected whichever phase is executed first. In order to take the best advantage of the Instruction Level Parallelism (ILP), compilers need to minimize both delays due to memory …
-
Global register allocation using program structure
The Chaitin-Briggs approach to register allocation by graph coloring is the dominant method used in industrial and research compilers. It usually produces highly-efficient allocations, but sometimes exhibits pathological spilling behavior so that some programs execute significantly more spill …
-
Dynamic Register Allocation for Network Processors
… demands, we first propose hardware management of registers across multiple threads. In their PLDI 2004 paper, Zhuang and Pande for the first time proposed a compiler based scheme to support register allocation across threads; in this work, we extend their static allocation method to support …
-
Register allocation and optimization techniques in compiler construction
… thesis was to investigate the implementation of register allocation and optimization techniques used in the process of compiler construction. The implementation issues were investigated by choosing an architecture and examining various register allocation and optimization techniques. In choosing …
-
Fast, frequency-based, integrated register allocation and instruction scheduling
Instruction scheduling and register allocation are two of the important optimization phases in modern compilers as they have significant impact on the quality of the generated code. Unfortunately, the objectives of these two optimizations are in conflict with one another. The instruction scheduler …
-
Register allocation and spilling using the expected distance heuristic
The primary goal of the register allocation phase in a compiler is to minimize register spills to memory. Spills, in the form of store and load instructions, affect execution time as the processor must wait for the slower memory system to respond. Deciding which registers to spill can benefit from …
-
Parameterization and adaptive search for graph coloring register allocation
Graph coloring register allocators use heuristics for register coalescing and allocation, which are relevant to the number of physical registers that a group of virtual registers will use after allocation. They cannot be determined accurately in allocation, thus we made them tunable by introducing …
-
BUBO: An Experiment in Local Spilling for Global Register Allocation
… as a pre-conditioner for a graph-coloring global register allocator. The job of a register allocator is to decide, at each point in the code, which values should be kept in registers and which values should be kept, instead, in memory; and which values should be kept in which register for those …
-
A unified approach to instruction scheduling and register allocation on clustered VLIW processors
… problem with VLIW processors is that a single register file hampers the scalability of the processor. Clustering is an efficient technique for improving the scalability and energy consumption of VLIW processors. In a clustered VLIW processor, each cluster has its own functional units and local …
-
Towards Constructing a Tunable Register Allocator
… so that users may use them without fault. The register allocation process is a critical phase of the compiler, assigning program values to fast access storage known as registers. Efficient register allocation can address memory wall challenges, but it is difficult given the task of assigning a …
-
Compiler Optimization Effects on Register Collisions
… toward this goal is to keep values in fast registers to limit the number of slower memory accesses that occur. When there are not enough physical registers available for use, values are ``spilled'' to the runtime stack. The need for spills is discovered during register allocation wherein …
-
Tuning a priority-based register allocator using adaptive compilation
Register allocation is a long studied optimization in compiler construction because it provides great opportunity for improving execution time. Adaptive compilation is a relatively new technique that uses repeated compilation and search to find effective parameters for compiler optimizations. We …
-
Compacting Loads and Stores for Code Size Reduction
… properly. This mover optimization occurs before register allocation, while ARMLoadStoreOpt occurs after register allocation. This thesis implements a similar mover optimization (called MagnetPass) after register allocation is performed, and compares this implementation with the existing …
-
Characterization and optimization of JavaScript programs for mobile systems
… Subsequently, a particular optimization, i.e. Register Allocation heuristics was explored in detail on different types of JavaScript programs. This was primarily because the majority of the time (an average of 52.81%) spent in the optimizing compiler is for the register allocation stage alone. …
-
Constraint Programming Techniques for Optimal Instruction Scheduling
… scheduling. Instruction scheduling coupled with register allocation is also a well studied problem to produce better machine code. Scheduling basic blocks and superblocks optimally with or with out register allocation is NP-complete, and is done sub-optimally in production compilers using …
-
WCET-aware compilation techniques for clustered VLIW processors
… the problem of instruction scheduling and register allocation for a program executed on a clustered VLIW processor such that the WCET of the program is minimized, and propose a novel, unified instruction scheduling and register allocation heuristic approach. Our approach iteratively selects …
Page 1 of 3