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 32 for “"Optimizing compilers."”.
-
The Design of Intermediate Languages in Optimizing Compilers
Every compiler passes code through several stages, each a sort of mini- compiler of its own. Thus each stage may deal with the code in a different representation, which may have little to do with the source or target language. We can describe these in-memory representations as languages in their …
-
PTUNE: A Tool for Online Autotuning with Optimizing Compilers
Harnessing the full potential of complex architectures has been a perennial challenge for the high- performance computing community. Each new architecture has brought with it new features that have added to the complexity and has required significant time and effort in re-targeting and retuning of …
-
The formal relationship between direct and continuation-passing style optimizing compilers: A synthesis of two paradigms
Compilers for higher-order programming languages like Scheme, ML, and Lisp can be broadly characterized as either "direct compilers" or "continuation-passing style (CPS) compilers", depending on their main intermediate representation. Our central result is a precise correspondence between the two …
-
Automatic Generation and Management of Program Analyses
Designing a program analysis (for use in optimizing compilers) is a time-consuming, complicated process because it involves many parameters. In particular, one must carefully measure the accuracy of the analysis against its cost. To reach an acceptable cost-accuracy balance the designer must …
-
Memory disambiguation to facilitate instruction-level parallelism compilation
… the problem of ambiguous memory dependences, optimizing compilers perform memory disambiguation.
-
Interactive source-level debugging of globally optimized code with expected behavior
Optimizing compilers and source-level debuggers have become essential for program development. However, their basic premises differ, so it is difficult for them to coexist within a programming environment. The primary purpose of a compiler is to make a program run faster while preserving the …
-
High-Level Compiler Optimizations for Python Programs
… it becomes increasingly critical to build optimizing compilers that are able to generate efficient sequential and parallel code from Python pro- grams to keep up with the insatiable demands for performance in these domains. Programs written in high-level languages like Python often make …
-
Performance analysis of memory hierarchies in high performance systems
… intensive programs are also likely to use highly optimizing compilers to produce the fastest executables possible. Methods to reduce the amount of data traffic by increasing the average number of references to each item while it resides in the cache are explored. Increasing the average number of …
-
LOW-LEVEL SEMANTICS AND OPTIMIZATIONS
Modern optimizing compilers rely heavily on precise static analyses, such as alias analysis, to validate semantics-preserving program transformations. However, low-level languages like C and compiler intermediate representations like LLVM IR permit complex memory operations---such as casts between …
-
Thread Escape Analysis for a Memory Consistency -Aware Compiler
… to prototype different memory models; and optimizing compilers to adapt to different memory models. Among the key analyses required to implement this system are thread escape analysis, i.e. detecting when a referenced object is accessible by more than one thread, synchronization analysis, …
-
Analysis and application of Fourier-Motzkin variable elimination to program optimization : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science at Massey University, Albany, New Zealand
… dependence analysis techniques in use by optimizing compilers: Fourier-Motzkin Variable Elimination, the Banerjee Bounds Test, the Omega Test, and the I-Test. Although the performance and effectiveness of these tests have previously been documented empirically, no in-depth analysis of how …
-
Elementary function evaluation using New Hardware Instruction
… register pressure we would recommend that optimizing compilers always in-line such functions, further improving performance by eliminating function-call overhead.</p> <p>On the Cell/B.E. SPU, we found an overall 234% increase in throughput for the new table-based methods, with increased …
-
ASTRAL: A Framework for Modern SQL Compiler
Optimizing compilers and program analysis tools rely heavily on searching large abstract syntax trees (ASTs) for specific patterns to apply rewrite rules. This search is often a major performance bottleneck, particularly for large or complex programs. In this thesis, I develop a declaratively …
-
A type-based prototype compiler for telescoping languages
… languages calls for automatically generating optimizing compilers for these languages by pre-compiling the underlying libraries that define them to generate multiple variants optimized for use in different possible contexts, including different argument types. The resulting compiler replaces …
-
Formally Verified Space-Safety for Program Transformations
Existing work on compilers has often primarily concerned itself with preserving behavior, but programs have other facets besides their observable behavior. We expect that the performance of our code is preserved and bettered by the compiler, not made worse. Unfortunately, that's exactly what …
-
Performance enhancing software loop transformations for embedded VLIW/EPIC processors
… loop optimization technique widely used in optimizing compilers. This technique is particularly effective in the context of multimedia and signal processing embedded applications, since the time critical segments of such applications are typically loops. Although software pipelining can …
-
Dependence Analysis for Subscripted Variables and its Application to Program Transformations
… can affect the execution time of the program. Optimizing compilers have made use of this fact by reordering code to improve its performance on a machine. Some statement orderings are essential to a program's results, however; these orderings form the basis of a dependence relation among the …
-
Understanding Optimization Phase Interactions to Reduce the Phase Order Search Space
… also improve the quality of code generated by optimizing compilers. We examine the effect of removing cleanup phases, such as dead assignment elimination, which should not interact with other compiler phases, from the phase order search space. Finally, we show that reorganization of the phase …
-
Oatlog: A high-performance e-graph engine
… development depends on efficient and reliable optimizing compilers. Traditional compilers apply a sequence of transformations to a single version of a program, with the final result being dependent on the order in which optimizations are applied. However, no single ordering can capture all …
-
Programming Language Tools and Techniques for Computational Fabrication
… applicability of this approach for developing optimizing compilers for different kinds of fabrication techniques. Both these equality saturation based approaches require manually writing the rewrites which itself is tedious and error-prone. A novel framework for automatically inferring rewrites …
Page 1 of 2