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

  1. Highly Scalable and Accelerated Kernel machine Training For Classification and Regression Problems

    … Computing) systems, such as distributed memory clusters, many-core systems, accelerators, and emerging technology called Performance Computing) systems, such as distributed memory clusters, many-core systems, accelerators, and emerging technology called neural engines or tensor core units …

    houston Repository record for Highly Scalable and Accelerated Kernel machine Training For Classification and Regression Problems (opens in a new tab)

  2. 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) Download PDF for Load Balancing Parallel Explicit State Model Checking (opens in a new tab)

  3. 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)

  4. 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)

  5. 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)

  6. Computational Models for Diusion of Second Messengers in Visual Transduction

    … is achieved via parallelization for distributed memory clusters of processors. The homogenized limit problem is also tested and the computational model based on its weak form is found to produce qualitatively similar results as from the full model. We also tested a spatially adaptive mesh for the …

    utk-theses Repository record for Computational Models for Diusion of Second Messengers in Visual Transduction (opens in a new tab)

  7. Dynamic Task Execution on Shared and Distributed Memory Architectures

    … world of high performance computing, from shared memory machines to the largest distributed memory clusters. The multicore route to increased performance has a simpler design and better power efficiency than the traditional approach of increasing processor frequencies. But, standard programming …

    utk-theses Repository record for Dynamic Task Execution on Shared and Distributed Memory Architectures (opens in a new tab)

  8. Finite element methods for viscoelastic fluid flow simulations: Formulations and applications

    … implementation efficiency on distributed-memory clusters. The governing equations are converted into a set of first-order partial differential equations by introducing the velocity gradient as an additional unknown. Thereby four unknown fields---pressure, velocity, conformation, and …

    rice Repository record for Finite element methods for viscoelastic fluid flow simulations: Formulations and applications (opens in a new tab)

  9. Feature Extension of MASS C++ towards a General Purpose Library

    … for agent-based simulations on distributed memory clusters, organised around the Bulk Synchronous Parallel model and a master-worker coordination scheme. Three structural limitations have constrained its applicability as a general-purpose runtime. An integer-based method dispatch scheme …

    washington Repository record for Feature Extension of MASS C++ towards a General Purpose Library (opens in a new tab)

  10. Communication performance measurement and analysis on commodity clusters.

    … analysis for MPI libraries, on both distributed memory clusters and shared memory parallel computers. The performance evaluation was done using MPIBench, a new MPI benchmark program that provides some useful new functionality compared to existing MPI benchmarks. Since there has been only limited …

    adelaide Repository record for Communication performance measurement and analysis on commodity clusters. (opens in a new tab)

  11. Compiler and system for resilient distributed heterogeneous graph analytics

    … billion edges. Since machines have limited main memory, distributed-memory clusters with sufficient memory and computation power are required for processing of these graphs. In distributed graph analytics, the graph is partitioned among the machines in a cluster, and communication between …

    texas Repository record for Compiler and system for resilient distributed heterogeneous graph analytics (opens in a new tab)