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 4 of 4 for “"Coalesced memory"”.

  1. GPU-parallelisation and integration of multiwavelet grid adaptation for fast discontinuous Galerkin modelling of multiscale flooding on LISFLOOD-FP

    … challenging due to major obstacles in achieving coalesced memory access (aligned memory access by threads) and avoiding warp divergence (different execution paths within a warp). To overcome these obstacles, initially for a Haar wavelet (HW) grid adaptation algorithm, three computational …

    whiterose Download PDF for GPU-parallelisation and integration of multiwavelet grid adaptation for fast discontinuous Galerkin modelling of multiscale flooding on LISFLOOD-FP (opens in a new tab)

  2. Exploiting Multigrain Parallelism in Pairwise Sequence Search on Emergent CMP Architectures

    … which include optimal data layout strategies, coalesced memory accesses and blocked data decomposition techniques. Results show that our methods provide a maximum speedup of 3.6 on the nVIDIA GPGPU when compared to the performance of the naive implementation of Smith-Waterman.

    vt Repository record for Exploiting Multigrain Parallelism in Pairwise Sequence Search on Emergent CMP Architectures (opens in a new tab)

  3. General Purpose Computation on Graphics Processing Units Using OpenCL

    … is promised by different shared and distributed memory architectures such as, super-computer systems, grid and cluster based systems, multi-core and multiprocessor systems etc. In the recent years the use of GPUs (Graphic Processing Units) for General purpose computing commonly known as GPGPU …

    poli-torino Repository record for General Purpose Computation on Graphics Processing Units Using OpenCL (opens in a new tab)

  4. Tuned and asynchronous stencil kernels for CPU/GPU systems

    We describe heterogeneous multi-CPU and multi-GPU implementations of Jacobi's iterative method for the 2-D Poisson equation on a structured grid, in both single- and double-precision. Properly tuned, our best implementation achieves 98% of the empirical streaming GPU bandwidth (66% of peak) on a …

    gatech Repository record for Tuned and asynchronous stencil kernels for CPU/GPU systems (opens in a new tab)