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 15 of 15 for “"Register Allocation"”.

  1. Architecture independent register allocation

    Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.

    mit Repository record for Architecture independent register allocation (opens in a new tab)

  2. 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 …

    unlv Repository record for Register allocation and optimization techniques in compiler construction (opens in a new tab)

  3. 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 …

    calpoly Repository record for Compiler Optimization Effects on Register Collisions (opens in a new tab)

  4. 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 …

    calpoly Repository record for Compacting Loads and Stores for Code Size Reduction (opens in a new tab)

  5. Automating the construction of a complier heuristics using machine learning

    … problems such as instruction scheduling and register allocation. To make matters worse, separate optimization phases have strong interactions and competing resource constraints. Compiler writers deal with system complexity by dividing the problem into multiple phases and devising approximate …

    mit Repository record for Automating the construction of a complier heuristics using machine learning (opens in a new tab)

  6. An annotated catalogue of works for piano duet a supplement to Cameron McGraw's Piano duet repertoire

    … of the musical material in terms of balance, register allocation, and the expansion and/or reduction of range and textural density; pedal markings and the transcription of interpretative, dynamic and articulation markings.

    cape-town Repository record for An annotated catalogue of works for piano duet a supplement to Cameron McGraw's Piano duet repertoire (opens in a new tab)

  7. Compiler Optimisation of Typeless Languages

    … useful in typeless compilation. We present a new register allocation and assignment scheme. Unlike traditional "colouring" allocators, our method separates the problem into distinct allocation and assignment phases. The former is achieved by using an iterative process to extend a local (within …

    cambridge Repository record for Compiler Optimisation of Typeless Languages (opens in a new tab)

  8. Translation validation for compilation verification

    … the Instruction Selection phase and the Register Allocation phase. The two systems share the same notion of equivalence (cut-bisimulation), the same proof system (KEQ), as well as the semantic definitions for the input/output languages (LLVM IR and x86-64 based Machine IR), which are …

    uiuc Repository record for Translation validation for compilation verification (opens in a new tab)

  9. Automatic determination of may/must set usage in data-flow analysis

    … in performance improving transformations such as register allocation, deadcode elimination, common subexpression elimination, and scheduling. Current tools for generating data-flow analysis implementations enable analysis details to be specified orthogonally to the solution algorithm, but still …

    colostate Repository record for Automatic determination of may/must set usage in data-flow analysis (opens in a new tab)

  10. Task scheduling in high-level synthesis

    … VLSI CAD. This thesis addresses scheduling and allocation in high-level synthesis. Specifically, we study the problem of register allocation in the presence of conditional blocks, such as if and case blocks and loops in the data flow graph. A conditional block in a data flow graph introduces the …

    uiuc Repository record for Task scheduling in high-level synthesis (opens in a new tab)

  11. Memory optimization techniques for embedded systems

    … from graph-based solutions, dealing with modify registers, and the effective utilization of multiple address registers. In addition to offset assignment, address register allocation is important for embedded DSPs. Chapter 4 develops a lower bound and an algorithm that can eliminate the explicit …

    lsu-thes Repository record for Memory optimization techniques for embedded systems (opens in a new tab)

  12. Transparent spilling and refilling of partitioned overlapping register window register organizations with a remote instruction pointer

    Register allocation is critical to processor performance. Registers are the fastest storage system available to a processor. The more capable a register set's organization is at maintaining process context, the fewer the number of memory accesses the processor will need to make. Overlapping …

    vt Repository record for Transparent spilling and refilling of partitioned overlapping register window register organizations with a remote instruction pointer (opens in a new tab)

  13. Compilation and Scheduling Techniques for Embedded Systems

    … Most modern DSPs provide multiple address registers and a dedicated address generation unit (AGU) which performs address generation in parallel to instruction execution. A careful placement of variables in memory is important in decreasing the number of address arithmetic instructions …

    lsu-thes Repository record for Compilation and Scheduling Techniques for Embedded Systems (opens in a new tab)

  14. Red-blue and standard pebble games : complexity and applications in the sequential and parallel models

    … been used in a variety of applications including register allocation, VLSI design, compilers, and, more recently, propositional proof complexity and memory-hard functions. Much previous research has been done in analyzing the computational complexity of the standard pebble game in a variety of …

    mit Repository record for Red-blue and standard pebble games : complexity and applications in the sequential and parallel models (opens in a new tab)