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 30 for “"Compiler Optimization"”.

  1. Compiler Optimization Effects on Register Collisions

    <p>We often want a compiler to generate executable code that runs as fast as possible. One consideration 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 …

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

  2. Automatic profiler-driven probabilistic compiler optimization

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

    mit Repository record for Automatic profiler-driven probabilistic compiler optimization (opens in a new tab)

  3. Compiler Optimization Techniques for Scheduling and Reducing Overhead

    … This dissertation develops and evaluates several compiler optimizations aimed at improving the performance of loops on processors. An important feature of a class of scientific computing problems is the regularity exhibited by their access patterns. Chapter 2 presents an approach of optimizing the …

    lsu-thes Repository record for Compiler Optimization Techniques for Scheduling and Reducing Overhead (opens in a new tab)

  4. A compiler optimization framework for Concordia parallel C

    … we present the design and implementation of a compiler optimization framework for the Concordia Parallel C (CPC). CPC is the working language for the Concordia Parallel Systems Simulator (CPSS), whose purpose is to study interactions between parallel runtime systems and languages and their …

    concordia Repository record for A compiler optimization framework for Concordia parallel C (opens in a new tab)

  5. Automatic Source Code Transformation To Pass Compiler Optimization

    Loop vectorization is a powerful optimization technique that can significantly boost the runtime of loops. This optimization depends on functional equivalence between the original and optimized code versions, a requirement typically established through the compiler's static analysis. When this …

    vt Repository record for Automatic Source Code Transformation To Pass Compiler Optimization (opens in a new tab)

  6. Compilation Techniques for Explicitly Parallel Programs

    … We also extend commonly used classical compiler optimization techniques to parallel program using those intermediate representations. By doing this, we guarantee the correctness (sequential consistency) of the optimized program and maintain single processor performance in a …

    uiuc Repository record for Compilation Techniques for Explicitly Parallel Programs (opens in a new tab)

  7. Characterizing function inlining with genetic programming

    Function inlining is a compiler optimization where the function call is replaced by the code from the function itself. Using a form of machine learning called genetic programming, this thesis examines which factors are important in determining which function calls to inline to maximize performance. …

    mit Repository record for Characterizing function inlining with genetic programming (opens in a new tab)

  8. Performance evaluation of vector machine architectures

    … over different workloads and depends strongly on compiler optimizations. Recently it has been claimed that several horizontal superscalar architectures, e.g., VLIW and polycyclic architectures, provide a more balanced performance across a wider range of scientific workloads than do vector …

    uiuc Repository record for Performance evaluation of vector machine architectures (opens in a new tab)

  9. Optimizing the Distributed Hydrology Soil Vegetation Model for Uncertainty Assessment with Serial, Multicore and Distributed Accelerations

    … code base. Specifically this paper investigates compiler optimization, implementing par- allel computing with OpenMP, and adding distributed computing with OpenMPI. DHSVM was also tuned to run many instances on California Polytechnic State Uni- visity, San Luis Obispo’s high performance computer …

    calpoly Repository record for Optimizing the Distributed Hydrology Soil Vegetation Model for Uncertainty Assessment with Serial, Multicore and Distributed Accelerations (opens in a new tab)

  10. Rule-based optimization with K-framework

    The thesis discusses pre-compiler optimization using rule-based rewriting. Our goal is to facilitate the proof of correctness of the process of program optimization. A source-to-source optimizer based on the proposed strategy can be a preprocessor to a certified compiler such as CompCert and this …

    uiuc Repository record for Rule-based optimization with K-framework (opens in a new tab)

  11. Combining Prior Knowledge and Data: Beyond the Bayesian Framework

    … driving a car up a mountain in simulation), and optimization (optimizing performance of linear algebra operations on different hardware platforms). For the text categorization problem, we introduce a novel algorithm which efficiently integrates prior knowledge into large margin classification. …

    uiuc Repository record for Combining Prior Knowledge and Data: Beyond the Bayesian Framework (opens in a new tab)

  12. Dynamic Optimization in Hardware

    … we describe the relationship between well-known compiler optimization concepts and hardware-implemented optimizations. We define and explore two hardware-centric dynamic optimization paradigms: continuous optimization and discrete optimization. Continuous optimization optimizes instructions in …

    uiuc Repository record for Dynamic Optimization in Hardware (opens in a new tab)

  13. Algorithms for automatic parallelism, optimization, and optimal processor utilization

    … we first investigate the reaching definitions optimization. This compiler optimization collects and stores information about where a variable is defined and how long that definition of the variable stays alive before it is redefined. We compare the old iterative solution to a new algorithm that …

    unlv Repository record for Algorithms for automatic parallelism, optimization, and optimal processor utilization (opens in a new tab)

  14. Fast Reducer Hyperobjects

    … by three approaches: runtime data structures, compiler-runtime integration, and compiler optimization. When these approaches are used to performance-engineer the OpenCilk runtime system's reducers, the overall performance of a benchmark suite designed to stress-test reducers sees a geometric …

    mit Repository record for Fast Reducer Hyperobjects (opens in a new tab)

  15. Execution model and optimizing compilation for execution migration

    … a reality, no concrete execution model or compiler exist for these machines. This limits the complexity of software that can be written for these machines, and therefore also the scope of studies for which these machines can be used. In this thesis, we define a productive programming model …

    mit Repository record for Execution model and optimizing compilation for execution migration (opens in a new tab)

  16. Simultaneous exploitation of task and data parallelism in regular scientific applications

    … of users, which creates a need for sophisticated compiler and run-time support for distributed memory machines. In this thesis we explore a new compiler optimization for regular scientific applications--the simultaneous exploitation of task and data parallelism. Our optimization is implemented as …

    uiuc Repository record for Simultaneous exploitation of task and data parallelism in regular scientific applications (opens in a new tab)

  17. Vector coprocessor sharing techniques for multicores: performance and energy gains

    … exacerbated without loop unrolling or other compiler optimization techniques. Additionally, existing rigid SIMD architectures cannot tolerate efficiently dynamic application environments with many cores that may require the runtime adjustment of assigned vector resources in order to operate …

    njit Repository record for Vector coprocessor sharing techniques for multicores: performance and energy gains (opens in a new tab)

  18. Compiler-Directed Error Resilience for Reliable Computing

    … first proposes to design and develop a compiler-directed lightweight methodology which leverages idempotent processing and the state-of-the-art sensor-based detection to achieve soft error resilience at low-cost. This dissertation also introduces a lightweight soft error tolerant …

    vt Repository record for Compiler-Directed Error Resilience for Reliable Computing (opens in a new tab)

  19. Control Flow Merging: A Compiler Transformation to Mitigate Branch Misprediction by Branch Elimination

    … a major performance bottleneck. Existing compiler solutions, such as outcome pre-computation and simple predication, are effective only for loop-invariant conditions or small side-effect-free branches. This work introduces Control Flow Merging (CFM), a compiler transformation that …

    vt Repository record for Control Flow Merging: A Compiler Transformation to Mitigate Branch Misprediction by Branch Elimination (opens in a new tab)

Page 1 of 2