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 42 for “"Compiler Optimizations"”.

  1. Applied Compiler Optimizations for Proving Code

    … to optimizing prover systems by modifying the compiler to produce proof-ready code. It proposes a benchmarking framework for comparing the relative proof costs of RISC-V instructions; the resulting analyis find that shift instructions do not offer heavy savings over multiplication. The finding …

    mit Repository record for Applied Compiler Optimizations for Proving Code (opens in a new tab)

  2. Implementing compiler optimizations using parallel graph reduction

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

    mit Repository record for Implementing compiler optimizations using parallel graph reduction (opens in a new tab)

  3. Compiler optimizations for an asynchronous stream-oriented programming language

    … In this thesis, we present several compiler optimizations for WaveScript, a high-level, functional, stream-oriented programming language. We also present a framework for using profiling of stream-graph execution to drive optimizations; two of the optimizations use this profiled …

    mit Repository record for Compiler optimizations for an asynchronous stream-oriented programming language (opens in a new tab)

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

  5. Hardware and software for functional and fine-grain parallelism

    … of FORTRAN codes are presented, as well as compiler and run-time algorithms designed to exploit it. Hardware and software embodiments of the dynamic scheduling algorithms are developed, along with the compiler optimizations necessary to make these practical.

    uiuc Repository record for Hardware and software for functional and fine-grain parallelism (opens in a new tab)

  6. 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)

  7. Specifying and verifying program transformations with PTRANS

    Software developers, compiler designers, and formal methods researchers all stand to benefit from improved tools for compiler design and verification. Program correctness for compiled languages depends fundamentally on compiler correctness, and compiler optimizations are usually not formally …

    uiuc Repository record for Specifying and verifying program transformations with PTRANS (opens in a new tab)

  8. Exploring design decisions for mutation testing

    … the developers. Second, we explore the effect of compiler optimizations on mutation testing. Multiple mutation testing tools were developed that perform mutation at different levels. More recently mutation testing has been performed at the level of compiler intermediate representation (IR), e.g., …

    uiuc Repository record for Exploring design decisions for mutation testing (opens in a new tab)

  9. A differential approach to undefined behavior detection

    … and their effects can be further amplified by compiler optimizations. Undefined behavior bugs are present in many systems, including the Linux kernel and the Postgres database. The consequences range from incorrect functionality to missing security checks. This thesis proposes a formal and …

    mit Repository record for A differential approach to undefined behavior detection (opens in a new tab)

  10. Automatic Time-Bound Analysis for High-Level Languages

    … for reactive systems, interactive environments, compiler optimizations, performance evaluation, and many other computer applications. Automatic and efficient prediction of accurate time bounds is particularly important, and being able to do so for high-level languages is particularly desirable. …

    iu Repository record for Automatic Time-Bound Analysis for High-Level Languages (opens in a new tab)

  11. Optimizing scheduling for stream structured programming for StreamIt

    … easily, the scheduling backend of the StreamIt compiler is not adapted to the heterogeneous and distributed nature of new accelerator hardware. This thesis details the design and development of a scheduler interface that enables hardware customized schedulers to be developed quickly. The …

    mit Repository record for Optimizing scheduling for stream structured programming for StreamIt (opens in a new tab)

  12. Polyhedral Code Transformation for Julia

    … correctness, but is more aggressive than typical compiler optimizations. This paper describes the process of applying the polyhedral model to the Julia language with the acceleration of code via increased vectorization and memory locality in mind. It succeeds as a tool for both experienced …

    mit Repository record for Polyhedral Code Transformation for Julia (opens in a new tab)

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

    Compiler writers are expected to create effective and inexpensive solutions to NP-hard 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 …

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

  14. Adaptive compilation and inlining

    … to improve the performance of individual compiler optimizations. We first examine the ability to use adaptive compilation with current commercial compilers. We use adaptive techniques to find good blocking sizes with the MIPSpro compiler. However, we also observe that current compilers are …

    rice Repository record for Adaptive compilation and inlining (opens in a new tab)

  15. How should compilers represent fork-join parallelism?

    … such as Cilk and OpenMP, can be embedded into a compiler's intermediate representation (IR). Mainstream compilers typically treat parallel linguistic constructs as syntactic sugar for function calls into a parallel runtime. These calls prevent the compiler from performing optimizations across …

    mit Repository record for How should compilers represent fork-join parallelism? (opens in a new tab)

  16. Making non-volatile memory programmable

    … for mistakes while also being too rigid for compiler optimizations. Likewise, at the hardware level, too little information is passed to the processor about the instruction-level ordering requirements of persistent applications; this forces the hardware to require the use of coarse fences, …

    uiuc Repository record for Making non-volatile memory programmable (opens in a new tab)

  17. Automatic translation of CUDA to OpenCL and comparison of performance optimizations on GPUS

    … on a variety of devices. However, current compiler optimizations are not sufficient to translate performance from a single expression of the program onto a wide variety of different architectures. To achieve true performance portability, an open standard like OpenCL needs to be augmented …

    uiuc Repository record for Automatic translation of CUDA to OpenCL and comparison of performance optimizations on GPUS (opens in a new tab)

  18. Performance evaluation and enhancement of Dendro

    … the performance of (default) Dendro by using compiler-provided optimizations and achieved more than 65% speedup over compiler optimized performance (20X over the naive Dendro performance) by manually tuning some-block of code along with the compiler-optimizations.

    uiuc Repository record for Performance evaluation and enhancement of Dendro (opens in a new tab)

Page 1 of 3