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 14 of 14 for “"Program Optimization"”.
-
A language and a system for program optimization
… architectures evolve and new ones are adopted, programs must often be altered by numerous optimizations to attain maximum computing power on each target environment. As a result, the code becomes unrecognizable over time, hard to maintain, and challenging to modify. Furthermore, as the code …
-
Program Optimization Strategies for Data-Parallel Many-Core Processors
… work discusses various strategies for optimizing programs on a highly data-parallel architecture with fine-grained sharing of resources. I first investigate useful strategies in optimizing a suite of applications. I then introduce program optimization carving, an approach that discovers …
-
Accuracy-aware optimization of approximate programs
… allow us to investigate new, more aggressive optimization approaches. This dissertation presents a foundation of program optimization systems that expose and profitably exploit tradeoffs between the accuracy of the results that the program produces and the time and energy required to produce …
-
Program auto-tuning through population-based stochastic optimization
Program optimization often can and need to be decoupled from the programs innate logic. In various domains, program autotuners have been developed which can automatically search for optimal program configurations using established optimization methods. OpenTuner is a general-purpose autotuner which …
-
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 …
-
Region-based Program Specialization
Program specialization or partial evaluation is a proven program optimization technique dating back to the early seventies. One common flavor of program specialization is offline partial evaluation. It employs a program analysis to determine what operations can be reduced at specialization time. …
-
Program transformation and code generation for developing, modeling, and optimizing GPU programs
… To help bridge the gap between fully automated optimization, which does not reliably produce optimal code, and fully manual optimization, which is inefficient and error-prone, we present three mechanisms facilitating a human-guided, partially automated process for production, optimization, and …
-
Scalable and efficient tools for multi-level tiling
… has limited the use of multi-level tiling to program optimization experts. We present solutions to two fundamental problems in multi-level tiling, viz., optimal tile size selection and parameterized tiled loop generation. Our solutions provide scalable and efficient tools for multi-level …
-
Iterative Schedule Optimization for Parallelization in the Polyhedron Model
… that have the ability to automatically optimize programs for a specific target hardware can be highly useful in this context. Iterative (or search-based) compilation requires little or no prior knowledge and can adapt more easily to concrete programs and target hardware than static cost models …
-
Cover crop programs, termination methods and timings, and suppression mechanisms on weed growth and competition
… how termination timing influences herbicide program optimization. A delay in emergence and growth rate of Palmer amaranth was documented in the CC containing plots when compared to the no CC plots, but no differences were observed between the termination timings. Additionally, significantly …
-
Compilation Techniques for Reconfigurable Analog Devices
… capabilities and physical limitations of the reprogrammable analog hardware. The compiler targets these specifications when mapping the computation. To faithfully implement a computation, the compiler configures the device so that the original dynamical system dynamics can be recovered from the …
-
Optimization by runtime specialization for sparse matrix-vector multiplication
Runtime specialization optimizes programs based on partial information available only at run time. It is applicable when some input data is used repeatedly while other input data varies. This technique has the potential of generating highly efficient codes. In this thesis we explore the potential …
-
Parallel algorithms for two-stage stochastic optimization
… scalable algorithms for two-stage stochastic program optimizations. We propose performance optimizations such as cut-window mechanism in Stage 1 and scenario clustering in Stage 2 of benders method for solving two-stage stochastic programs. A naive implementation of benders method has slow …