Sep 2026· IEEE International Conference on Cluster Computing· pp. 350-362· 0 citations· 44 references
TL;DR
NDP-CP's task handoff between peers reduces latency by 12-46% over prior systems relying on host-mediated coordination, while deferring memory operations in NDP-CP leads to a 21-41% latency reduction over modern caching mechanisms for NUMA memory management without explicit data replication.
Abstract
We introduce near-data processing with collaborative peers (NDP-CP), a novel approach to NDP workload execution in modern systems. NDP-CP leverages Compute Express Link (CXL) peer-to-peer (P2P) communication to enable compute and memory interactions across peer devices. This design addresses the limitation in many existing NDP systems, which assume each NDP device operates independently, relying on host-mediated coordination and data replication. NDP-CP introduces two separate strategies to leverage peer devices. One enables task handoff between peer devices for decentralized workload execution. The other models CXL-based NDP systems with P2P communication as a non-uniform memory access (NUMA) architecture and reduces remote memory access overheads by deferring operations on remote data. We implement NDP-CP across various workloads, including approximate nearest neighbor search (ANNS), graph processing, and sparse matrix multiplication (SpMM), demonstrating its efficacy. NDP-CP's task handoff between peers reduces latency by 12-46% over prior systems relying on host-mediated coordination, while deferring memory operations in NDP-CP leads to a 21-41% latency reduction over modern caching mechanisms for NUMA memory management without explicit data replication.
Gutenberg, a CPU+NDP for mutable, latency-critical cloud services, outperforms prior systems, reducing average and p99 latency by up to 80.4% and 85.8% and improves isolation and fairness while adapting to changing workload behaviors.
Qi Lin, Phillip B. Gibbons, Jovan Stojkovic et al.· 0 citations
This work presents ActiveRDMA, an active RDMA model that extends traditional one-sided semantics by leveraging on-NIC programmability, and enables complex, multi-step RDMA patterns to execute directly on the target side, eliminating host CPU involvement and reducing communication round-trips.
Jerónimo Sánchez García, Peter-Jan Gootzen, Raphael Frantz et al.· Proceedings of the Internati...· 0 citations
Computational solid-state drives (CompSSDs) are evolving into intelligent storage solutions that integrate near-data computing architectures to achieve computation-storage convergence. They can reduce the overhead of data migration and then accelerate the execution of data-centric workloads through in-situ processing....
Xin-Yue Xun, Jiao-Jiao Wu, Zhi-Bing Sha et al.· ACM Transactions on Storage· 0 citations
Datacenter congestion control (CC) and load balancing (LB) evolve rapidly as workload demands change, but deployment depends on RDMA hardware and transport interfaces. Emerging programmable RDMA engines tie policy code to vendor APIs. Operators must therefore port each policy for every platform they deploy. We address...
Mikhail Khalilov, Timo Schneider, Tommaso Bonato et al.· 0 citations
The Message Passing Interface (MPI) is widely adopted in high-performance computing (HPC) systems to support scalable inter-process communication. While HPC systems are theoretically expected to offer high performance, they often fall short in practice due to the overhead from MPI. In particular, MPI collective communi...
Seon Young Kim, Hooyoung Ahn, Jaewon Lee et al.· IEEE International Conferenc...· 0 citations
VarioPath, an efficient AlltoAllv scheduling framework for PCIe GPU systems that combines an offline topology-aware analyzer with an online demand-aware scheduler, and shows average AlltoAllv speedups of 5.88x over FAST and 1.72x over DeepEP.
Yao Fei, Jin Fang, Si-Ze Zheng et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.