PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 7, 2026Proceedings of the VLDB Endowment0 citations

SVFusion: A CPU-GPU Co-Processing Architecture for Large-Scale Real-Time Vector Search

View Full Paper
YPYuchen PengZhejiang Sci-Tech UniversityDYDingyu YangZhejiang Sci-Tech UniversityZXZhongle XieNingbo University

Key Points

  • The research aims to develop an efficient framework for large-scale real-time vector search that bridges GPU and CPU processing.
  • Developed SVFusion as a collaborative framework combining CPU, GPU, and disk for vector search
  • Implemented a hierarchical vector index architecture with CPU-GPU co-processing
  • Designed a workload-aware vector caching mechanism
  • Utilized CUDA multi-stream optimization for performance enhancement
  • Ensured data consistency with concurrency control during updates and queries.
  • Achieved a 20.9× higher throughput on average compared to baseline methods
  • Reduced query latency by 1.3× to 50.7× versus existing solutions
  • Maintained high recall for large-scale datasets under various streaming workloads.

Abstract

Approximate Nearest Neighbor Search (ANNS) underpins modern applications such as information retrieval and recommendation. With the rapid growth of vector data, efficient indexing for real-time vector search has become rudimentary. Existing CPU-based solutions support updates but suffer from low throughput, while GPU-accelerated systems deliver high performance but face challenges with dynamic updates and limited GPU memory, resulting in a critical performance gap for continuous, large-scale vector search requiring both accuracy and speed. In this paper, we present SVFusion, a GPU-CPU-disk collaborative framework for real-time vector search that bridges sophisticated GPU computation with online updates. SVFusion leverages a hierarchical vector index architecture that employs CPU-GPU co-processing, along with a workload-aware vector caching mechanism to maximize the efficiency of limited GPU memory. It further enhances performance through real-time coordination with CUDA multi-stream optimization and adaptive resource management, along with concurrency control that ensures data consistency under interleaved queries and updates. Empirical results demonstrate that SVFusion achieves significant improvements in query latency and throughput, exhibiting a 20.9× higher throughput on average and 1.3× to 50.7× lower latency compared to baseline methods, while maintaining high recall for large-scale datasets under various streaming workloads.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Peng et al. (2026) studied this question.

synapsesocial.com/papers/69fbefc0164b5133a91a3cf7https://doi.org/10.14778/3796195.3796216
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Product Quantization for Nearest Neighbor Search2010 · 2,981 citations
  2. 2Efficient k-nearest neighbor graph construction for generic similarity measures2011 · 683 citations
  3. 3What Goes Around Comes Around... And Around...2024 · 25 citations
  4. 4A Real-Time Adaptive Multi-Stream GPU System For Online Approximate Nearest Neighborhood Search2024 · 7 citations
  5. 5Locality-sensitive hashing scheme based on dynamic collision counting2012 · 239 citations