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 29 for “"Performance Optimizations"”.

  1. Performance Optimizations for Isolated Driver Domains

    … domain-based isolation incurs significant performance overhead due to the necessary interdomain communication. This thesis investigates techniques for reducing this overhead. The key idea is to replace the interrupt-based notification between domains with a spinning-based approach, thus …

    vt Repository record for Performance Optimizations for Isolated Driver Domains (opens in a new tab)

  2. Automatic translation of CUDA to OpenCL and comparison of performance optimizations on GPUS

    … a variety of devices. However, current compiler optimizations are not sufficient to translate performance from a single expression of the program onto a wide variety of different architectures. To achieve true performance portability, an open standard like OpenCL needs to be augmented with …

    uiuc Repository record for Automatic translation of CUDA to OpenCL and comparison of performance optimizations on GPUS (opens in a new tab)

  3. Building a Distributed Transaction Processing System Using DARQ

    … resilience mechanisms. This thesis explores the performance and usability of DARQ through the development of a distributed transaction processing system. DARQ is evaluated by performance on the YCSB and TPCC benchmark and by the ease of programming with it. The abstraction of CReSt and DARQ, …

    mit Repository record for Building a Distributed Transaction Processing System Using DARQ (opens in a new tab)

  4. CPU/GPU Code Acceleration on Heterogeneous Systems and Code Verification for CFD Applications

    … code-to-code comparisons. First, a variety of performance optimizations both agnostic and specific to applications and platforms are developed in order to 1) improve the heterogeneous CPU/GPU compute utilization; 2) improve the memory bandwidth to the main memory; 3) reduce communication …

    vt Repository record for CPU/GPU Code Acceleration on Heterogeneous Systems and Code Verification for CFD Applications (opens in a new tab)

  5. Cache and NUMA optimizations in a domain-specific language for graph processing

    High-performance graph processing is challenging because the sizes and structures of real-world graphs can vary widely. Graph algorithms also have distinct performance characteristics that lead to different performance bottlenecks. Even though memory technologies such as CPU cache and non-uniform …

    mit Repository record for Cache and NUMA optimizations in a domain-specific language for graph processing (opens in a new tab)

  6. Programmer feedback and dynamic analysis to enable optimization in Java applications: the D.U.P.O. framework

    … languages. This makes it more difficult to apply optimizations aggressively. This thesis introduces the D.U.P.O. framework to facilitate the use of dynamic analyses to enable performance optimizations. Since dynamic analyses cannot guarantee complete code coverage, a two part strategy is employed: …

    unm Repository record for Programmer feedback and dynamic analysis to enable optimization in Java applications: the D.U.P.O. framework (opens in a new tab)

  7. Design and implementation of an analyzer for a timed pi-calculus

    … deadlock states, stable states etc. To improve performance, the analyzer uses some transformation techniques to simplify the input kiltera model without changing its behavior. We provide a detailed description of the design and implementation of the analyzer and discuss some performance

    queens Repository record for Design and implementation of an analyzer for a timed pi-calculus (opens in a new tab)

  8. Extracting and optimizing low-level bytecode from high-level verified Coq

    … Collection requirements and an emphasis on performance. MCQC targets the Gallina functional language used in the Coq proof assistant. MCQC translates pure and recursive functions into C++17, while compiling monadic effectful functions to imperative C++ system calls. With a series of memory …

    mit Repository record for Extracting and optimizing low-level bytecode from high-level verified Coq (opens in a new tab)

  9. GPU-accelerated Inference for Discrete Probabilistic Programs

    … factor graph IR. Our system enables significant performance optimizations through static analysis of the factor graph structure. Variable elimination is optimized by reduction to tensor contraction with optimized contraction paths, while Gibbs sampling is automatically parallelized through graph …

    mit Repository record for GPU-accelerated Inference for Discrete Probabilistic Programs (opens in a new tab)

  10. Performance optimization of a split-value voting system

    … The main work done in this thesis is a series of performance optimizations to the existing prototype, greatly improving the real-world viability of the system. Finally, we suggest further work that can be done to improve performance, fault tolerance, and security. The code that accompanies this …

    mit Repository record for Performance optimization of a split-value voting system (opens in a new tab)

  11. Democratizing Details-on-demand Data Visualizations at Scale

    … to transparently handle the rendering and performance optimizations needed to enable fluid interactions on large datasets.

    mit Repository record for Democratizing Details-on-demand Data Visualizations at Scale (opens in a new tab)

  12. High-Speed Simulator for Millimeter-Wave Synthetic Aperture Radar

    … images. These techniques, combined with other performance optimizations, allow mmSim to achieve an over 24x improvement in speed over state-of-the-art mmWave simulators.

    mit Repository record for High-Speed Simulator for Millimeter-Wave Synthetic Aperture Radar (opens in a new tab)

  13. GPU-Optimized Molecular Dynamics Simulations

    … particles. We then present novel GPU-specific performance optimization techniques for MD simulations, including 1) a new Verlet-type neighbor list algorithm that is readily implemented using the CUDPP library and 2) data type compression scheme, as well as standard GPU-optimization techniques …

    wfu Repository record for GPU-Optimized Molecular Dynamics Simulations (opens in a new tab)

  14. Enabling massive parallelism for two-stage stochastic integer optimizations a branch and bound based approach

    … decisions. Modern supercomputers can attain performance of several petaflops and hence can enhance solution tractability for use in a highly dynamic decision environment. We start with a conventional parallel decomposition of the problem, analyze the challenges and address a number of …

    uiuc Repository record for Enabling massive parallelism for two-stage stochastic integer optimizations a branch and bound based approach (opens in a new tab)

  15. Efficient Verifiable Computation Made Easy

    … notoriously computationally intensive, making performance a critical concern. Given the inherent data parallelism and heavy use of vector operations in ZKP computations, multicore CPUs and GPUs offer a promising acceleration path. Unfortunately, accelerated programming for ZKP remains …

    mit Repository record for Efficient Verifiable Computation Made Easy (opens in a new tab)

  16. JUST-IN-TIME SCALE-OUT OF SHELL PROGRAMS, CORRECTLY

    … they do not enjoy access to automated performance optimizations typically found in other language environments---including parallelization for scaling out on multicore CPUs and distribution to support processing of data that does not fit on a single machine. This unfortunate state of …

    penn Repository record for JUST-IN-TIME SCALE-OUT OF SHELL PROGRAMS, CORRECTLY (opens in a new tab)

  17. Sampling Methods for Fast and Versatile GNN Training

    … learning models that achieve state-of-the-art performance in various applications. A prevalent and effective approach for applying GNNs on large datasets involves mini-batch training with sampled neighborhoods. Numerous sampling algorithms have emerged, some tailored for specific GNN …

    mit Repository record for Sampling Methods for Fast and Versatile GNN Training (opens in a new tab)

  18. Efficient parallel processing and fault tolerance in a streaming join system

    … stream joins. RiverJoin implements critical performance optimizations like batching and automatic parallelization, having performance comparable to lossy windowed joins while maintaining its strong correctness semantics. The individual contributions of the thesis come from further extending …

    mit Repository record for Efficient parallel processing and fault tolerance in a streaming join system (opens in a new tab)

  19. Context-Aware Resource Management

    The demand for performance and resources that is placed on the system is dictated by the application alone in non-interactive environments, and by a combination of application and user interactions in interactive environments. Understanding user interaction can provide valuable information about …

    arizona-thes Repository record for Context-Aware Resource Management (opens in a new tab)

  20. Improving web applications with fine-grained data flows

    … to support the wide range of services and performance requirements that users have come to expect. On the client-side, browsers are multi-process systems that can handle numerous content formats, rich interactivity, and asynchronous 10 patterns. On the server-side, applications are …

    mit Repository record for Improving web applications with fine-grained data flows (opens in a new tab)

Page 1 of 2