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 789 for “"Compilation"”.

  1. Collaborative compilation

    … when tuning the compiler. Collaborative compilation alleviates this problem by using local profiling information for at-the-factory style training, allowing users to tune their compilers based on the applications that they use most. It takes advantage of the repeated compilations …

    mit Repository record for Collaborative compilation (opens in a new tab)

  2. Credible compilation

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

    mit Repository record for Credible compilation (opens in a new tab)

  3. Region-based compilation

    … in conventional compilers. Traditionally the compilation process has been built using the function as a compilation unit, because the function provides a convenient partition of the program. However, the size and contents of a function may not provide the best environment for aggressive …

    uiuc Repository record for Region-based compilation (opens in a new tab)

  4. Adaptive compilation and inlining

    Adaptive compilation uses a feedback-driven process to leverage additional compilation time into improved executable performance. Previous work on adaptive compilation has demonstrated its benefit at an inter-optimization level. This dissertation investigates the ability of adaptive techniques to …

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

  5. Sparse tensor algebra compilation

    This dissertation shows how to compile any sparse tensor algebra expression to CPU and GPU code that matches the performance of hand-optimized implementations. A tensor algebra expression is sparse if at least one of its tensor operands is sparse, and a tensor is sparse if most of its values are …

    mit Repository record for Sparse tensor algebra compilation (opens in a new tab)

  6. Partial compilation of constraint problems

    … such queries are NP-hard problems. Knowledge Compilation (KC) methods were developed to deal with the complexity of solving combinatorial problems online by creating a representation offline that is able to answer queries in time that is polynomial in the size of the representation [DM02]. …

    cork Repository record for Partial compilation of constraint problems (opens in a new tab)

  7. Systematic Compilation for Predicated Execution

    The Partial Reverse If-Conversion Framework, the Predicate Analysis System, the Predicate Dataflow Graph, and the Program Decision Logic Optimizer are demonstrated to work synergistically in the compiler to generate efficient code for nonnumeric programs. Using predication, these techniques …

    uiuc Repository record for Systematic Compilation for Predicated Execution (opens in a new tab)

  8. Translation validation for compilation verification

    … lack of formal correctness guarantees for the compilation process seriously limits the guarantees other software systems can provide, since the compiler that generates the final executable cannot be trusted. These circumstances have motivated broad interest in compilation verification: …

    uiuc Repository record for Translation validation for compilation verification (opens in a new tab)

  9. Compilation Techniques for Explicitly Parallel Programs

    We introduce two intermediate representations: the concurrent control flow graph, and the concurrent static single assignment form. Based on these representations, we develop an analysis technique, called concurrent global value numbering, by extending classical value partitioning and global value …

    uiuc Repository record for Compilation Techniques for Explicitly Parallel Programs (opens in a new tab)

  10. Optimizations in Distributed Run -Time Compilation

    We also consider possibilities for optimizations, and present a rewriting system for Java abstract syntax trees designed to optimize the code generators. This general-purpose optimizer exploits the compositional nature of Jumbo to aggressively optimize the code generators for the individual code …

    uiuc Repository record for Optimizations in Distributed Run -Time Compilation (opens in a new tab)

  11. Compilation techniques for short-vector instructions

    … and efficiently. One important aspect of compilation is the effective management of memory alignment. As with scalar loads and stores, vector references are typically more efficient when accessing aligned regions. In many cases, the compiler can glean no alignment information and must emit …

    mit Repository record for Compilation techniques for short-vector instructions (opens in a new tab)

  12. Compilation to a queue-based architecture

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

    mit Repository record for Compilation to a queue-based architecture (opens in a new tab)

  13. Compilation Techniques for Reconfigurable Analog Devices

    … quantization error. In this thesis, I present compilation techniques for automatically configuring such devices to execute dynamical systems and present the first compiler that automatically targets a physical dynamical system-solving reconfigurable analog device of this class. The presented …

    mit Repository record for Compilation Techniques for Reconfigurable Analog Devices (opens in a new tab)

  14. Verified compilation of abstract network policies

    Configuring large networks can be very complex. A network administrator typically has a set of high-level policies in mind when creating a network configuration, but implementing the configuration onto existing hardware often requires specifying many low-level details. As a result, configuring a …

    mit Repository record for Verified compilation of abstract network policies (opens in a new tab)

  15. Prolac--a language for protocol compilation

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

    mit Repository record for Prolac--a language for protocol compilation (opens in a new tab)

  16. Policy Compilation for Stochastic Constraint Programs

    Real-world risk-bounded planning and decision-making problems are fluid, uncertain, and highly dynamic, demanding an architecture which can encode and solve a rich set of problems involving decision-making under uncertainty. While many solution architectures exist for solving deterministic CSPs, …

    mit Repository record for Policy Compilation for Stochastic Constraint Programs (opens in a new tab)

  17. Compilation and Scheduling Techniques for Embedded Systems

    Embedded applications are constantly increasing in size, which has resulted in increasing demand on designers of digital signal processors (DSPs) to meet the tight memory, size and cost constraints. With this trend, memory requirement reduction through code compaction and variable coalescing …

    lsu-thes Repository record for Compilation and Scheduling Techniques for Embedded Systems (opens in a new tab)

  18. Structure driven multiprocessor compilation of numeric problems

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.

    mit Repository record for Structure driven multiprocessor compilation of numeric problems (opens in a new tab)

  19. Compilation using correct-by-construction program synthesis

    … assembly language. Our core idea is to phrase compilation of shallowly embedded programs to a lower-level deeply embedded language as a synthesis problem, solved using simple proof-search techniques. This technique is extensible (support for individual language constructs is provided by a …

    mit Repository record for Compilation using correct-by-construction program synthesis (opens in a new tab)

  20. High level compilation for gate reconfigurable architectures

    … programs. This solution is the key to efficient compilation of high-level programs to gate reconfigurable architectures. My approach to specialization includes several novel techniques. I develop, with others, extensive bitwidth analyses that apply to registers, pointers, and arrays. I use …

    mit Repository record for High level compilation for gate reconfigurable architectures (opens in a new tab)

Page 1 of 40