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 24 for “"Compiler Analysis"”.
-
Unconventional Applications of Compiler Analysis
Previously, compiler transformations have primarily focused on minimizing program execution time. This thesis explores some examples of applying compiler technology outside of its original scope. Specifically, we apply compiler analysis to the field of software maintenance and evolution by …
-
Compiler Analysis of Sparse and Irregular Computations
… all of which can be applied automatically by a compiler. We compared their ease of use, applicability, supporting compiler techniques required, run-time resource requirement, and, most importantly, run-time performance. From our analysis and experiments, we developed a general guideline for …
-
Compiler analysis and optimization of memory management In modern processors
… we address in our thesis. We develop a static compiler analysis to model the data cache usage of a given loop nest. Then we use the cache analysis in a cost model to guide the unroll-jam loop transformation with the objective of maximizing reuse of the data in cache. This compiler optimization …
-
Compiler and run-time support for irregular computations
… dynamics, circuit simulation and structural analysis that can be more accurately modeled using iterations on unstructured grids. In these problems, regular compiler analysis for Massively Parallel Processors (MPP) with distributed address space fails because the communication can only be …
-
Compiler Support for Long-life, Low-overhead Intermittent Computation on Energy Harvesting Flash-based Devices
… on energy harvesters make use of novel compiler analysis techniques as well as on-board hardware on devices to measure the energy remaining for useful computation. However, currently available programming models, which mostly target devices with FRAM as the NVM, would cause failure on …
-
Automatic data aggregation for software distributed shared memory systems
… The chief reason for this is that hand-coded and compiler-generated message-passing programs typically achieve better data aggregation in their messages than programs using software DSM. Software DSM has poorer data aggregation because the system lacks the knowledge of the application's behavior …
-
Hybrid analysis of memory references and its application to automatic parallelization
… has not been achieved because classic, static compiler analysis was not powerful enough and program behavior was found to be, in many cases, input dependent. Speculative thread level parallelization was a welcome avenue for advancing parallelization coverage but its performance was not always …
-
A Framework for Faster Software Verification and Better Compiler Optimizations through Symbiosis
Despite significant advancements over the years, compilers and software verification systems still face limitations in their capabilities. The conservative nature of static program analysis restricts the applicability and effectiveness of compiler optimizations. In addition, software verification …
-
Automated Runtime Analysis and Adaptation for Scalable Heterogeneous Computing
… extracting optimal performance via manual analysis and optimization is a complicated and time-consuming process. This dissertation presents graph-structured program representations to reason about the performance bottlenecks on modern HPC systems and to guide novel automation frameworks for …
-
Automatic and interactive parallelization
… caches and a common bus. In particular, the compiler maps complete applications onto the specifics of a machine, exploiting both parallelism and memory. To optimize complete applications, we develop novel, general algorithms to transform loops that contain arbitrary conditional control flow. …
-
Dynamic execution prediction and pipeline balancing of streaming applications
… execution behavior prediction approach based on compiler analysis that can be used to efficiently estimate the time to be spent in different pipeline stages for upcoming inputs. Our approach first uses dynamic taint analysis to automatically generate an input-based execution characterization of …
-
A Compiler Optimization Framework for Directive-Based GPU Computing
… types of memory in the accelerator. Where the compiler analysis is insufficient, an explicit directive-based approach is proposed to guide the compiler to perform specific optimizations. We have chosen to implement and evaluate our work using the OpenACC programming model, as it is the most …
-
Runtime Enforcement of Memory Safety for the C Programming Language
… safety. This dissertation introduces MemSafe, a compiler analysis and transformation for ensuring the memory safety of C programs at runtime while avoiding the above drawbacks. MemSafe makes several novel contributions that improve upon previous work and lower the runtime cost of achieving memory …
-
The Galois System: Optimistic Parallelization of Irregular Programs
… nature of these applications, static compiler analysis does not suffice to uncover any parallelism. Instead, successful parallelization requires speculative, or optimistic, parallelization. However, existing speculation techniques, such as thread-level speculation, are too low-level to …
-
Improving Performance Portability and Productivity of Parallel Scientific Applications for Exascale
… on improving MPI applications. Petal uses compiler-analysis techniques to transform the application's source code, with minimal user intervention, to make use of better, smarter MPI functions that are currently available (or in the future) while maintaining applications' correctness. Petal …
-
Array optimizations for high productivity programming languages
… hybrid approach. We use an interprocedural rank analysis algorithm to automatically infer ranks of arrays in X10. We use rank analysis information to enable storage transformations on arrays. If rank-independent array references still remain after compiler analysis, the programmer can use X10's …
-
Memory profiling and management.
… operations. This dissertation addresses two compiler techniques related to memory optimizations: memory disambiguation profiling and local memory management. The static memory disambiguation analyses in a compiler, such as alias analysis and dependence analysis, are often limited by the lack …
-
Improving prediction accuracy of hard-to-predict branches using data value correlation
… of relying on branch history information, compiler identifies program instructions whose output value strongly correlates with branch outcome. These correlated instructions are tracked at run-time, and their output is used for making branch predictions. Specifically, this thesis proposes …
-
A Semantics-Based Approach to Optimizing Unstructured Mesh Abstractions
… both introduce additional overhead and hinder compiler analysis and subsequent optimization. Our work exploits the semantics of abstractions, as employed in unstructured mesh codes, to overcome these limitations and to guide a series of manual, domain-specific optimizations that significantly …
-
Fine-grained containment domains for throughput processors
… the pro- gram becomes amenable to automatic analysis and tuning, and an optimum trade-off can be made between preservation and recovery overhead. To aid this optimization process, an analytical model is developed to estimate the performance efficiency of a given application setting at a given …
Page 1 of 2