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 17 of 17 for “"code optimization"”.

  1. Automatic test generation for the detection of performance bugs in code optimization

    … itself. For example, by simply inspecting the code of a web server, one cannot determine what is the expected throughput. This makes performance testing for performance a challenging task. Testing compilers adds another layer of complexity. For compilers, a correctness bug during compiler …

    uiuc Repository record for Automatic test generation for the detection of performance bugs in code optimization (opens in a new tab)

  2. Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests

    … parallel loop program in the model to efficient code meets with several obstacles, due to which performance may deteriorate seriously -- especially on distributed memory architectures. We introduce a fine-grained model of the computation performed and show how this model can be applied to create …

    passau-thes Repository record for Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests (opens in a new tab)

  3. Memory disambiguation to facilitate instruction-level parallelism compilation

    … the compiler must perform aggressive low-level code optimization and scheduling. However, ambiguous memory dependences can significantly limit the compiler's ability to expose ILP. To overcome the problem of ambiguous memory dependences, optimizing compilers perform memory disambiguation.

    uiuc Repository record for Memory disambiguation to facilitate instruction-level parallelism compilation (opens in a new tab)

  4. Efficient Support for Speculative Tasking

    … information for a variety of purposes including code optimization and debugging.

    uiuc Repository record for Efficient Support for Speculative Tasking (opens in a new tab)

  5. Automatic differentiation of the CapeML high-level language for process engineering

    … modeling languages. Rather than a procedural code, equation-based concept defines dependencies between model variables which is advantageous for building compound models in process engineering. Therefore, at Process Systems Engineering at RWTH Aachen University, CapeML, an XML based language …

    aachen Repository record for Automatic differentiation of the CapeML high-level language for process engineering (opens in a new tab)

  6. Compiler support for multiple-instruction-issue architectures

    … apply the profile information to guide various code improving techniques, and map the program parallelism onto the parallel architecture. Our base code optimization technology is comparable to today's best commercial C compilers. In addition, we have developed aggressive code generation …

    uiuc Repository record for Compiler support for multiple-instruction-issue architectures (opens in a new tab)

  7. Optimization and validation of discontinuous Galerkin Code for the 3D Navier-Stokes equations

    … in particular, this thesis focuses on code optimization. Performance properties of DG methods are identified, including key memory bottlenecks. A detailed overview of the memory hierarchy on modern CPUs is given along with discussion on optimization suggestions for utilizing the …

    mit Repository record for Optimization and validation of discontinuous Galerkin Code for the 3D Navier-Stokes equations (opens in a new tab)

  8. FCUDA: Efficient high-level automation CUDA-to-FPGA compilation

    … compiler FCUDA, which transforms CUDA kernel code into synthesizable C code, exploits the parallelism in different applications with the help of the manually inserted pragmas by the programmers. The additional effort to tweak the code to enable efficient mapping of the tasks across the …

    uiuc Repository record for FCUDA: Efficient high-level automation CUDA-to-FPGA compilation (opens in a new tab)

  9. Practical techniques to augment dependence analysis in the presence of symbolic terms

    … We investigate three approaches to enhancing code optimization in the presence of symbolic terms: run-time testing, inserting user assertions, and compiling the program together with its input. Breaking conditions are created by the dependence analyzer when the presence of symbolic terms make …

    rice Repository record for Practical techniques to augment dependence analysis in the presence of symbolic terms (opens in a new tab)

  10. Preliminary Investigation of Productivity Tools for Memory Profiling in Parallel Programs

    … constrained by hardware scaling limitations, code optimization grows increasingly important as an area of research. The impact of certain optimizations depends on whether a program is compute-bound or memory-bound. Memory-bound computations especially benefit from program transformations that …

    mit Repository record for Preliminary Investigation of Productivity Tools for Memory Profiling in Parallel Programs (opens in a new tab)

  11. Read alignment using deep neural networks

    … is comparable to other tools without any code optimization or integration of other advanced features. Moreover, DNN exhibits superior performance in comparison with Minhashon neighborhood classification.

    colostate Repository record for Read alignment using deep neural networks (opens in a new tab)

  12. Constructing Efficient Extensible Compilers With Incremental Analysis

    Much of the research in compiler design and optimization has traditionally focused on the effectiveness and efficiency of code optimization. However, the subject of efficiency of the entire compilation process itself (as opposed to the complexity of individual analysis or optimization algorithms) …

    uiuc Repository record for Constructing Efficient Extensible Compilers With Incremental Analysis (opens in a new tab)

  13. Optimization of a Coded-Modulation System with Shaped Constellation

    … approach for shaping the constellations used by coded-modulation systems. The focus is on designing shaping techniques for systems that use a combination of amplitude phase shift keying (APSK) and low-density parity check (LDPC) coding. Such a combination is typical of modern satellite …

    wvu Repository record for Optimization of a Coded-Modulation System with Shaped Constellation (opens in a new tab)

  14. Scaling finite difference methods in large eddy simulation of jet engine noise to the petascale: numerical methods and their efficient and automated implementation

    … array programming, and the accompanying code optimization and generation methodologies. Through empirical experiments, we demonstrate that truncated SPIKE-based spatial partial differentiation and spatial filtering deliver the theoretically promised optimal scalability in weak scaling …

    purdue-thes Repository record for Scaling finite difference methods in large eddy simulation of jet engine noise to the petascale: numerical methods and their efficient and automated implementation (opens in a new tab)

  15. Retargetable code generation based on an architecture description language

    … The compiler, more specifically the compiler's code selector, needs to know what an instructions does in order to select appropriate instructions for a given piece of source code, while the simulator needs to know how the instruction is executed. In practice it is quite difficult, if not …

    aachen Repository record for Retargetable code generation based on an architecture description language (opens in a new tab)

  16. Compiler Optimization Techniques for Scheduling and Reducing Overhead

    … 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 address …

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

  17. Automatisches Differenzieren für MATLAB

    … During the execution of the differentiated code a single derivative in one direction may be computed as well as, employing a runtime system, multiple directional derivatives may be calculated at once. The AD-tool implements a powerful specification language to efficiently specify the …

    aachen Repository record for Automatisches Differenzieren für MATLAB (opens in a new tab)