GPU-Accelerated ANNS: Quantized for Speed, Built for Change
Hunter McCoy, Zikun Wang, Prashant Pandey
摘要
Approximate nearest neighbor search (ANNS) is a core problem in machine learning and information retrieval. GPUs offer a promising path to high-performance ANNS through massive parallelism and co-location with downstream applications, but current GPU indices face three limitations: inability to update without full rebuilds, lack of efficient quantization for high-dimensional vectors, and poor latency hiding due to data-dependent memory accesses.
We present Jasper, a GPU-native ANNS system built on the Vamana graph index that achieves both high query throughput and full updatability via three new techniques: (1) a batch-parallel construction algorithm enabling lock-free streaming insertions, (2) a GPU-efficient RaBitQ implementation that reduces memory footprint up to 8× without random access penalties, and (3) an optimized search kernel with improved compute utilization and latency hiding.
Across five datasets, Jasper achieves up to 1.84 × higher throughput than CAGRA, the current state-of-the-art GPU index, while providing updatability that CAGRA lacks, constructs indices 7.0× faster on average, and delivers 10 -74 × faster queries than BANG, the previous fastest GPU Vamana implementation.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper9
- SONG: Approximate Nearest Neighbor Search on GPUWeijie Zhao, Shulong Tan, Ping LiICDE 2020 · 被引用 103 次
- Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with FiltersSiddharth Gollapudi, Neel Karia, Varun Sivashankar, Ravishankar Krishnaswamy 等WWW 2023 · 被引用 102 次
- RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor SearchJianyang Gao, Cheng LongSIGMOD 2024 · 被引用 83 次
- CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUsHiroyuki Ootomo, Akira Naruse, Corey Nolet, Ray Wang 等ICDE 2024 · 被引用 59 次
- ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search AlgorithmsMagdalen Dobson Manohar, Zheqi Shen, Guy E. Blelloch, Laxman Dhulipala 等PPoPP 2024 · 被引用 39 次
相关 Paper
- JUNO: Optimizing High-Dimensional Approximate Nearest Neighbour Search with Sparsity-Aware Algorithm and Ray-Tracing Core MappingZihan Liu, Wentao Ni, Jingwen Leng, Yu Feng 等ASPLOS 2024 · 被引用 21 次
- High-Throughput, Cost-Effective Billion-Scale Vector Search with a Single GPUHaodi Jiang, Hao Guo, Minhui Xie, Jiwu Shu 等SIGMOD 2026
- CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute-Memory DisaggregationChengying Huan, Renjie Yao, Shaonan Ma, Rong Gu 等SIGMOD 2026
- FlashANNS: GPU-Driven Asynchronous I/O Pipelining for Eliminating Storage-Compute Bottlenecks in Billion-Scale Similarity SearchYang Xiao, Mo Sun, Ziyu Song, Bing Tian 等SIGMOD 2026 · 被引用 3 次
- Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSDHao Guo, Youyou LuOSDI 2025 · 被引用 26 次
