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 5 of 5 for “"Memory clusters"”.

  1. Load Balancing Parallel Explicit State Model Checking

    … supercomputing architectures---distributed memory clusters, Networks of Workstations (NOW) and shared memory machines. The analysis shows increased speedup, lower maximum queue sizes and fewer total states explored before error discovery on each of the architectures. Finally, this research …

    byu Repository record for Load Balancing Parallel Explicit State Model Checking (opens in a new tab)

  2. Code generation of array constructs for distributed memory systems

    … evident when programming distributed memory clusters containing multiple NUMA chips and GPUs on each node since it would require a complex combination of MPI, OpenMP, CUDA, OpenCL, etc to achieve high performance even for sequentially simplistic codes. Programs requiring high …

    uiuc Repository record for Code generation of array constructs for distributed memory systems (opens in a new tab)

  3. Nodal Reordering Strategies to Improve Preconditioning for Finite Element Systems

    The availability of high performance computing clusters has allowed scientists and engineers to study more challenging problems. However, new algorithms need to be developed to take advantage of the new computer architecture (in particular, distributed memory clusters). Since the solution of linear …

    vt Repository record for Nodal Reordering Strategies to Improve Preconditioning for Finite Element Systems (opens in a new tab)

  4. Scalable Parallel Delaunay Image-to-Mesh Conversion for Shared and Distributed Memory Architectures

    … algorithms on both shared and distributed memory architectures. In this thesis we present a novel two-level parallel tetrahedral mesh generation framework capable of delivering and sustaining close to 6000 of concurrent work units (cores). We achieve this by leveraging concurrency at two …

    odu Repository record for Scalable Parallel Delaunay Image-to-Mesh Conversion for Shared and Distributed Memory Architectures (opens in a new tab)

  5. Scalable parallel simulation of small-scale structures in cold dark matter

    … (P³M) algorithm for distributed memory clusters. The llp3m-hc code uses a hybrid method for both computation and domain decomposition. Long-range forces are computed using a Fourier transform gravity solver on a regular mesh; the mesh is distributed across parallel processes using …

    mit Repository record for Scalable parallel simulation of small-scale structures in cold dark matter (opens in a new tab)