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 6 of 6 for “"Near data processing (NDP)"”.

  1. Near-memory primitive support and infratructure for sparse algorithm

    … traditional accelerators. By introducing simple near-data-processing (NDP) accelerators for primitives such as SpMV (Sparse Matrix Multiplication of Vectors) and DGEMM (Double Precision Dense Matrix Multiplication) kernels, applications can achieve a considerable performance boost. We evaluate …

    gatech Repository record for Near-memory primitive support and infratructure for sparse algorithm (opens in a new tab)

  2. Active Routing: Compute on the Way for Near-Data Processing

    The explosion of data availability and fast data analytic requirements led to the advent of data-intensive applications, characterized by their large memory footprint and low data reuse rate. These data intensive applications place a significant amount of stress on modern memory systems and …

    tamu Repository record for Active Routing: Compute on the Way for Near-Data Processing (opens in a new tab)

  3. Next-Generation Datacenter Infrastructure for Large-Scale Personalized Recommendation

    … models now consume the majority of the datacenter cycles spent on AI. Given the volume of personalized inferences and their rapid growth rate occurring in datacenters, we first propose RecNMP -- a lightweight, commodity DRAM compliant, near-memory processing (NMP) solution, to accelerate …

    wustl Repository record for Next-Generation Datacenter Infrastructure for Large-Scale Personalized Recommendation (opens in a new tab)

  4. Near Data Processing for Data-Intensive Machine Learning Workloads

    <p>The rapid growth of data-driven applications—spanning personalized recommendation, large-scale machine learning, federated learning, and vector databases—places unprecedented pressure on traditional computer architectures. Conventional systems struggle under the intense memory bandwidth demands …

    duke Repository record for Near Data Processing for Data-Intensive Machine Learning Workloads (opens in a new tab)

  5. Enabling efficient graph computing with near-data processing techniques

    With the emergence of data science, graph computing is becoming a crucial tool for processing big connected data. However, when mapped to modern computing systems, graph computing typically suffers from poor performance because of inefficiencies in memory subsystems. At the same time, emerging …

    gatech Repository record for Enabling efficient graph computing with near-data processing techniques (opens in a new tab)

  6. Accelerating irregular applications via efficient synchronization and data access techniques

    … and thus they are bottlenecked by expensive data access costs. This doctoral thesis studies the root causes of inefficiency of irregular applications in modern computing systems, and aims to fundamentally address such inefficiencies, by 1) proposing low-overhead synchronization techniques …

    greece Repository record for Accelerating irregular applications via efficient synchronization and data access techniques (opens in a new tab)