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 73 for “"Code optimization"”.

  1. Code optimization for the Choi-Williams distribution for ELINT applications

    … the time-frequency characteristics. The optimizations developed in this thesis reduced the time to compute a 512 sample CWD from 6.9 seconds, to 0.0466 seconds on an Intel chip, Linux based PC-an increase in speed of 147X.

    nps Repository record for Code optimization for the Choi-Williams distribution for ELINT applications (opens in a new tab)

  2. Design and Code Optimization for Systems with Next-generation Racetrack Memories

    With the rise of computationally expensive application domains such as machine learning, genomics, and fluids simulation, the quest for performance and energy-efficient computing has gained unprecedented momentum. The significant increase in computing and memory devices in modern systems has …

    qucosa-diss

  3. Machine learning enhanced code optimization for high-level synthesis (ML-ECOHS)

    … and portable. The problems in using HLL code to program FPGAs arise from the serial execution model of the target application codes, in particular, the mismatch between that model and the arbitrary data flow model of the target hardware. However, a variety of code transformation …

    bu Repository record for Machine learning enhanced code optimization for high-level synthesis (ML-ECOHS) (opens in a new tab)

  4. Code optimization and analysis for multiple-input and multiple-output communication systems

    Design and analysis of random-like codes for various multiple-input and multiple-output communication systems are addressed in this work. Random-like codes have drawn significant interest because they offer capacity-achieving performance. We first consider the analysis and design of low-density …

    tamu Repository record for Code optimization and analysis for multiple-input and multiple-output communication systems (opens in a new tab)

  5. Automatic test generation for the detection of performance bugs in code optimization

    … itself. For example, by simply inspecting the code of a web server, one cannot determine what is the expected throughput. This makes performance testing for performance a challenging task. Testing compilers adds another layer of complexity. For compilers, a correctness bug during compiler …

    uiuc Repository record for Automatic test generation for the detection of performance bugs in code optimization (opens in a new tab)

  6. Code optimization of speckle reduction algorithms for image processing of rocket motor holograms

    … particular this thesis deals with the software code optimization of existing automatic data retrieval algorithms that are used to extract useful particle information from the holograms using a microcomputer-based imaging system. Two forms of optimization were accomplished, the application of an …

    nps Repository record for Code optimization of speckle reduction algorithms for image processing of rocket motor holograms (opens in a new tab)

  7. Thermal Evolution of Planetesimals and Protoplanets in the Terrestrial Planet Region: Code Optimization and Implementation on a Distributed Grid using NetSolve

    <p>A code for asteroidal heat transfer and growth is optimized for performance. The Gauss elimination routine for the solver is replaced by a sparse matrix routine. Finite element matrix assembly operations are rewritten to reduce operations involving 3D arrays to 1D. Advantage is taken of the …

    ut-knoxville Repository record for Thermal Evolution of Planetesimals and Protoplanets in the Terrestrial Planet Region: Code Optimization and Implementation on a Distributed Grid using NetSolve (opens in a new tab)

  8. Kompiliatorių optimizavimas IA-64 architektūroje /

    After performance optimization of traditional architectures began to reach their limits, Intel corporation started to develop new architecture based on EPIC – Explicitly Parallel Instruction Counting. This main feature allowed up to six instructions to be executed in single CPU cycle. Also this …

    vilnius Repository record for Kompiliatorių optimizavimas IA-64 architektūroje / (opens in a new tab)

  9. An input-aware dynamic program graph representation for optimizing code performance using heterogeneous GNNs

    … (e.g., LLVM-IR) has been used to tackle some code optimization tasks; however, there has not been much effort to integrate dynamic analysis information with LLVM-IR for such cases. In this work, we propose an input-aware dynamic program graph `PerfoGraph+': which leverages Dynamic analysis …

    iastate Repository record for An input-aware dynamic program graph representation for optimizing code performance using heterogeneous GNNs (opens in a new tab)

  10. The portability of BCPL to the MC68000 via the intermediate language SLIM

    … the intermediate language SLIM, into assembler code for the Motorola MC68000. This is then assembled and loaded onto a MC68000 simulator where it successfully runs. The suitability of SLIM as an intermediate language is also studied, with a treatment on code optimization.

    ubc Repository record for The portability of BCPL to the MC68000 via the intermediate language SLIM (opens in a new tab) Download PDF for The portability of BCPL to the MC68000 via the intermediate language SLIM (opens in a new tab)

  11. Memory disambiguation to facilitate instruction-level parallelism compilation

    … the compiler must perform aggressive low-level code optimization and scheduling. However, ambiguous memory dependences can significantly limit the compiler's ability to expose ILP. To overcome the problem of ambiguous memory dependences, optimizing compilers perform memory disambiguation.

    uiuc Repository record for Memory disambiguation to facilitate instruction-level parallelism compilation (opens in a new tab)

  12. Efficient Support for Speculative Tasking

    … information for a variety of purposes including code optimization and debugging.

    uiuc Repository record for Efficient Support for Speculative Tasking (opens in a new tab)

Page 1 of 4