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 13 of 13 for “"code motion"”.

  1. Instructional footprinting: a basis for exploiting concurrency through instructional decomposition and code motion

    … a non-blocking request for data earlier in the code and retrieving the returned data later when it is needed. To facilitate a better understanding of how this type of concurrency can be exploited, we introduce an instructional footprint model and application framework that formally describes …

    vt Repository record for Instructional footprinting: a basis for exploiting concurrency through instructional decomposition and code motion (opens in a new tab)

  2. Value-driven redundancy elimination

    … is a combination of value numbering and code motion. Value numbering is an optimization that assigns numbers to values in such a way that two values are assigned the same number if the compiler can prove they are equal. When this optimization discovers two computations that produce the …

    rice Repository record for Value-driven redundancy elimination (opens in a new tab)

  3. Combining analyses, combining optimizations

    … that combines Constant Propagation, Unreachable Code Elimination, Global Congruence Finding and Global Value Numbering. For these optimizations, the iterative algorithm runs in $O(n\sp2)$ time. This thesis then presents an O(n log n) algorithm for combining the same optimizations. This technique …

    rice Repository record for Combining analyses, combining optimizations (opens in a new tab)

  4. Combined instruction scheduling and register allocation

    … dependencies are added. Although spill code is minimized, the execution time of the program may increase. When instruction scheduling is executed first, an efficient schedule is generated. However, the code motion that occurs after instruction scheduling generally increases spill code. …

    nus Repository record for Combined instruction scheduling and register allocation (opens in a new tab) Download file for Combined instruction scheduling and register allocation (opens in a new tab)

  5. Future value based single assignment program representations and optimizations

    … We demonstrate the importance of unrestricted code motion and present RFPF. We develop algorithms which enable instruction movement in acyclic, as well as cyclic regions, and show the ease to perform optimizations such as Partial Redundancy Elimination on RFPF.

    mtu Repository record for Future value based single assignment program representations and optimizations (opens in a new tab)

  6. Preserving Structural Alias Information Across the MLIR-to-LLVM Lowering Boundary

    … scale, where the efficiency of generated machine code directly affects throughput and energy consumption. The compilers that lower model specifications to hardware instructions rely on optimization passes that can only exploit information visible in the representations they operate on. MLIR, the …

    calpoly Repository record for Preserving Structural Alias Information Across the MLIR-to-LLVM Lowering Boundary (opens in a new tab)

  7. Profile-guided redundancy elimination

    … properties of the programs to analyse program code and make sure that the optimisations work for every possible combination of the program and the input data. This approach is conservative in those cases when the programs show the same runtime behaviours for most of their execution time. On the …

    unsw Repository record for Profile-guided redundancy elimination (opens in a new tab)

  8. Querying Nested Collections

    … optimizer capable of performing filter promotion, code motion, and loop fusion. Scanning routines and printing routines are considered as part of optimization process. An operational semantics that is a blending of eager evaluation and lazy evaluation is suggested in conjunction with these …

    penn Repository record for Querying Nested Collections (opens in a new tab)

  9. Compiling Java for high performance and the Internet

    … in a linear algebra package resulted in a code that is four times shorter, more extensible and less bug-prone than the equivalent Fortran-style code, but also many times slower. To address the poor performance problem, this dissertation introduces several new compilation techniques that can …

    rice Repository record for Compiling Java for high performance and the Internet (opens in a new tab)

  10. Software and architecture support for the bulk multicore

    … experience of programmers working on parallel code. Just as transactions in databases, it was the job of the runtime to detect any conflicts between parallel transactions and rollback the ones that needed to be re-executed, leaving the programmers blissfully unaware of the communication and …

    uiuc Repository record for Software and architecture support for the bulk multicore (opens in a new tab)

  11. From Mock Environments to Ownership-Aware Compilation: Practical Advances in Low-Level Program Reasoning

    … build software and when it scales to realistic codebases. In verification, one workflow challenge is that the cost of modeling the surrounding environment can exceed the cost of verifying the system itself. Another practical difficulty is scaling precise low-level reasoning and optimization to …

    waterloo Repository record for From Mock Environments to Ownership-Aware Compilation: Practical Advances in Low-Level Program Reasoning (opens in a new tab)

  12. Isothermality: making speculative optimizations affordable

    … ubiquitous compiler optimization, Partial Dead Code Elimination (PDCE), which removes computations whose values are not used. Isothermal Speculative PDCE (ISPDCE) is a new, simple, and efficient optimization which requires only three bit-vector analyses. We show, experimentally, that ISPDCE …

    uvic Repository record for Isothermality: making speculative optimizations affordable (opens in a new tab)

  13. The effect of censorship on American film adaptations of Shakespearean plays

    … 1, 1934, to November 1, 1968, the Production Code Administration (PCA) oversaw the creation of American motion pictures, in order to improve Hollywood’s moral standing. To assist in this endeavor, the studios produced film adaptations of classic literature, such as the plays of William …

    tamu Repository record for The effect of censorship on American film adaptations of Shakespearean plays (opens in a new tab)