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 16 of 16 for “"Near-Data Processing"”.

  1. Near-data processing for dynamic graph analytics

    Massive data rates in cybersecurity, simulation, and social media analysis applications are driving rapid advances in the field of streaming graph analytics. The data structures that enable streaming graph analytics pose unique challenges for high-performance computing system designers. When the …

    gatech Repository record for Near-data processing for dynamic graph analytics (opens in a new tab)

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

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

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

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

  6. A cross-stack, network-centric architectural design for next-generation datacenters

    This thesis proposes a full-stack, cross-layer datacenter architecture based on in-network computing and near-memory processing paradigms. The proposed datacenter architecture is built atop two principles: (1) utilizing commodity, off-the-shelf hardware (i.e., processor, DRAM, and network devices) …

    uiuc Repository record for A cross-stack, network-centric architectural design for next-generation datacenters (opens in a new tab)

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

  8. Architectural Support for Accelerating Machine Learning Inference

    … employing well-understood concepts of vector-processing and near-data processing with some modest, but key modifications that are critical to its performance. Through detailed microarchitecture simulations, it shows that VIP achieves competitive performance on a number of machine learning …

    cornell Repository record for Architectural Support for Accelerating Machine Learning Inference (opens in a new tab)

  9. Accelerator Architectures for Deep Learning and Graph Processing

    <p>Deep learning and graph processing are two big-data applications and they are widely applied in many domains. The training of deep learning is essential for inference and has not yet been fully studied. With data forward, error backward, and gradient calculation, deep learning training is a more …

    duke Repository record for Accelerator Architectures for Deep Learning and Graph Processing (opens in a new tab)

  10. Towards lowering the overhead of Open-Channel SSD

    … space industry has added many new challenges for data-driven application developers when developing execution planners. Traditionally the application, operating system, and storage controller have all separately handled the storage access pattern optimization and scheduling. Despite successful use …

    reykjavik Repository record for Towards lowering the overhead of Open-Channel SSD (opens in a new tab)

  11. Efficient Interconnection Network Design for Heterogeneous Architectures

    The onset of big data and deep learning applications, mixed with conventional general-purpose programs, have driven computer architecture to embrace heterogeneity with specialization. With the ever-increasing interconnected chip components, future architectures are required to operate under a …

    tamu Repository record for Efficient Interconnection Network Design for Heterogeneous Architectures (opens in a new tab)

  12. Energy efficient architectures for irregular data streams

    An increasing prevalence of data-irregularity is being seen in applications today, particularly in machine learning, graph analytics, high-performance computing and cybersecurity. Faced with fundamental technology constraints, architectures that have been designed around conventional assumptions on …

    gatech Repository record for Energy efficient architectures for irregular data streams (opens in a new tab)

  13. Main-memory near-data acceleration with concurrent host access

    Processing-in-memory is attractive for applications that exhibit low temporal locality and low arithmetic intensity. By bringing computation close to data, PIMs utilize proximity to overcome the bandwidth bottleneck of a main memory bus. Unlike discrete accelerators, such as GPUs, PIMs can …

    texas Repository record for Main-memory near-data acceleration with concurrent host access (opens in a new tab)

  14. Joint Optimization of Algorithms, Hardware, and Systems for Efficient Deep Neural Networks

    … including computer vision, natural language processing, and recommender systems. However, the typical deep neural network (DNN) models employed in these applications require millions of parameters and billions of operations, leading to substantial computational and memory requirements. While …

    duke Repository record for Joint Optimization of Algorithms, Hardware, and Systems for Efficient Deep Neural Networks (opens in a new tab)

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

  16. Near Memory Accelerators for Approximate Nearest Neighbor Search

    Approximate Nearest Neighbor (ANN) search has become a critical component in modern retrieval systems, supporting applications such as recommendation engines, semantic search, and large language models. Despite the effectiveness of embedding-based methods, performing ANN search over billion-scale, …

    mtu Repository record for Near Memory Accelerators for Approximate Nearest Neighbor Search (opens in a new tab)