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 75 for “"Massive parallelism"”.

  1. STAPL-RTS: A Runtime System for Massive Parallelism

    … built for portable performance, suitable for massively parallel machines. While the STAPL-RTS abstracts and virtualizes the underlying platform for portability, it uses information from the upper layers to perform the appropriate low level optimizations that restore the performance …

    tamu Repository record for STAPL-RTS: A Runtime System for Massive Parallelism (opens in a new tab)

  2. Coupled-Cluster Methods for Large Molecular Systems Through Massive Parallelism and Reduced-Scaling Approaches

    … this work, we introduce a new distributed-memory massively parallel implementation of standard and explicitly correlated (F12) coupled-cluster singles and doubles (CCSD) with canonical bigO{N^6} computational complexity ( C. Peng, J. A. Calvin, F. Pavov{s}evi'c, J. Zhang, and E. F. Valeev, …

    vt Repository record for Coupled-Cluster Methods for Large Molecular Systems Through Massive Parallelism and Reduced-Scaling Approaches (opens in a new tab)

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

    DoD's transportation activities incur USD 11+Billion expenditure anually. Optimal resource allocation under uncertainty provides huge opportunity for improvement and commensurate cost savings. Stochastic optimization techniques are used to incorporate uncertainty in the data to arrive at robust …

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

  4. Cellular neural network virtual machine for graphics hardware with applications in image processing

    The inherent massive parallelism of cellular neural networks makes them an ideal computational platform for kernel-based algorithms and image processing. General-purpose GPUs provide similar massive parallelism, but it can be difficult to design algorithms to make optimal use of the hardware. The …

    missouri Repository record for Cellular neural network virtual machine for graphics hardware with applications in image processing (opens in a new tab)

  5. Programming models, compilers, and runtime systems for accelerator computing

    … with discrete memory spaces. They possess massive parallelism, along with many other unique architectural features. In order to obtain high performance, these features must be carefully exploited, which requires high programmer expertise. This thesis presents new programming models, and the …

    purdue-thes Repository record for Programming models, compilers, and runtime systems for accelerator computing (opens in a new tab)

  6. Improving efficiency for GPUs with decoupled delegate

    … CPUs, largely due to GPUs’ ability to exploit massive parallelism. However, massive parallelism can cause inefficiency for many operations, such as concurrent data structures. Symptoms include synchronization bottleneck and redundant overheads. To make such operations efficient, our key …

    texas Repository record for Improving efficiency for GPUs with decoupled delegate (opens in a new tab)

  7. Parallel For Loops on Heterogeneous Resources

    … Their immense floating point throughput and massive parallelism make them ideal for not just graphical applications, but many general algorithms as well. Load balancing applications and taking advantage of all computational resources in a machine is a difficult challenge, especially when the …

    utk-theses Repository record for Parallel For Loops on Heterogeneous Resources (opens in a new tab)

  8. GPU-based digital hologram reconstruction and particle detection

    … and particle extraction system exploiting the massive parallelism of graphics processing units (GPUs) to reduce the time required to locate the particles in 3D space by orders of magnitude. This system requires no expensive proprietary hardware and runs on standard computers, with the only …

    umn Repository record for GPU-based digital hologram reconstruction and particle detection (opens in a new tab)

  9. Design and Analysis of Fault-Tolerant Processor Arrays for Numerical Applications

    … major class of numerical algorithms due to their massive parallelism and regular structure. However, the successful operation of a processor array depends very much on the correctness of all the processing elements in the array. Any single faulty processor may easily jeopardize the results of the …

    uiuc Repository record for Design and Analysis of Fault-Tolerant Processor Arrays for Numerical Applications (opens in a new tab)

  10. Scaling simple, compact and extended compact genetic algorithms using MapReduce

    … for processing large volumes of data exploiting massive parallelism. Data-intensive computing frameworks have shown that terabytes and petabytes of data can be routinely processed. However, there has been little effort to explore how data-intensive computing can help scale evolutionary …

    uiuc Repository record for Scaling simple, compact and extended compact genetic algorithms using MapReduce (opens in a new tab)

  11. A new general purpose systolic array for matrix computations

    … the architecture is systolic based, it brings massive parallelism to all of its computations. As a result, many matrix operations including addition, multiplication, inversion, LU-decomposition, transpose, and solutions to linear systems of equations can now be performed extremely fast. In …

    portland-state Repository record for A new general purpose systolic array for matrix computations (opens in a new tab)

  12. Hardware acceleration for sparse Fourier image reconstruction

    … We transform the algorithm to exploit massive parallelism available in the FPGA fabric. Our design allows different ways of chaining custom pipelined vector engines, so that different computations can be carried out without reconfiguration overhead. Actual runtime performance data show …

    uiuc Repository record for Hardware acceleration for sparse Fourier image reconstruction (opens in a new tab)

  13. GPU Execution Tracing and Compression

    … exacerbated on GPUs due to the large amount of parallelism. In fact, GPUs provide such massive parallelism that conventional tracing approaches either fail or only manage to trace very few events per thread. Hence, we need not only a low-overhead but also a space-efficient approach to make …

    texas-state Repository record for GPU Execution Tracing and Compression (opens in a new tab)

  14. Parallel SAT solvers and their application in automatic parallelization

    … arisen, allowing software to take advantage of parallelism without the need of parallel programming. We present here two proposals: SAT-PaDdlinG and RePaSAT. SAT-PaDdlinG is a parallel DPLL SAT Solver on GPU, which allows RePaSAT to use this environment. RePaSAT is our proposal of a parallel …

    brazil-ufrgs Repository record for Parallel SAT solvers and their application in automatic parallelization (opens in a new tab)

  15. Efficient Rendering of Scenes with Dynamic Lighting Using a Photons Queue and Incremental Update Algorithm

    … image synthesis. Moreover, it benefits from the massive parallelism computational power brought by recent developments in graphics processor hardwareand programming models. However rendering the scenes with dynamic lights stillgreatly limits the performance due to the re-construction at each …

    concordia Download PDF for Efficient Rendering of Scenes with Dynamic Lighting Using a Photons Queue and Incremental Update Algorithm (opens in a new tab)

  16. Error resilience evaluation on GPGPU applications

    … GPGPU applications is challenging due to their massive parallelism, which makes it difficult to achieve representativeness while being time-efficient. This thesis makes three key contributions. First, it presents the design of a fault-injection methodology to evaluate the end-to-end reliability …

    ubc Repository record for Error resilience evaluation on GPGPU applications (opens in a new tab) Download PDF for Error resilience evaluation on GPGPU applications (opens in a new tab)

  17. Parallel implementation and communication of low-level vision operations on a hypercube machine

    … processors with the potential to deliver massive parallelism cost-effectively have appeared in the computer market. Hypercube machines open the door to a wide variety of application areas that could benefit from parallelism. Computer vision and image processing is one of these application …

    ucf Repository record for Parallel implementation and communication of low-level vision operations on a hypercube machine (opens in a new tab)

  18. DATA DRIVEN ALGORITHMS AND DISTRIBUTED COMPUTING FOR AUTOMATIC MIP DECOMPOSITIONS

    … computing framework, which is able to exploit massive parallelism when decompositions allow so. We develop asynchronous and distributed column generation algorithms. Our approach turns out to be, on average, one order of magnitude faster than state-of-the-art solvers.

    milano Repository record for DATA DRIVEN ALGORITHMS AND DISTRIBUTED COMPUTING FOR AUTOMATIC MIP DECOMPOSITIONS (opens in a new tab)

  19. Efficient simulation techniques for large-scale applications

    … workloads that feature high throughput and massive parallelism, such as GPGPU kernels. In this dissertation, three simulation techniques were proposed to simulate emerging GPGPU kernels and data analytic workloads efficiently. First, TBPoint reduce the simulated instructions of GPGPU kernels …

    gatech Repository record for Efficient simulation techniques for large-scale applications (opens in a new tab)

  20. PARALLEL GRAPH PROCESSING ON GPUS

    … their power to accelerate the computation with massive parallelism, in this thesis, we aim to take advantage of this hardware advancement and design efficient solutions for graph processing on GPUs. First, we study the parallel design of subgraph enumeration and propose a scheme that can reuse …

    nus Repository record for PARALLEL GRAPH PROCESSING ON GPUS (opens in a new tab) Download file for PARALLEL GRAPH PROCESSING ON GPUS (opens in a new tab)

Page 1 of 4