RTop-K: Ultra-Fast Row-Wise Top-K Selection for Neural Network Acceleration on GPUs
Xi Xie, Yuebo Luo, Hongwu Peng, Caiwen Ding
Abstract
Top-k selection algorithms are fundamental in a wide range of applications, including high-performance computing, information retrieval, big data processing, and neural network model training. In this paper, we present RTop-K, a highly efficient parallel row-wise top-k selection algorithm specifically designed for GPUs. RTop-K leverages a binary search-based approach to optimize row-wise top-k selection, providing a scalable and accelerated solution. We conduct a detailed analysis of early stopping in our algorithm, showing that it effectively maintains the testing accuracy of neural network models while substantially improving performance. Our GPU implementation of RTop-K demonstrates superior performance over state-of-the-art row-wise top-k GPU implementations, achieving an average speed-up of up to 11.49× with early stopping and 7.29× without early stopping. Moreover, RTop-K accelerates the overall training workflow of MaxK-GNNs, delivering speed-ups ranging from 11.97% to 33.29% across different models and datasets. The GPU implementation can be found on Github † .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b1254b5e-67f0-480c-9270-6ff8b34f1b3cCited by top-tier papers2
- SonicMoE: Accelerating MoE with IO and Tile-aware OptimizationsWentao Guo, Mayank Mishra, Xinle Cheng, Ion Stoica et al.ICLR 2026 · 22 citations
- Stochastic Sparse Attention for Memory-Bound InferenceKyle Lee, Corentin Delacour, Kevin Callahan-Coray, Kyle Jiang et al.ICML 2026
Builds on6
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- GraphSAINT: Graph Sampling Based Inductive Learning MethodHanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan et al.ICLR 2020 · 1,155 citations
- Top-KAST: Top-K Always Sparse TrainingSiddhant M. Jayakumar, Razvan Pascanu, Jack W. Rae, Simon Osindero et al.NeurIPS 2020 · 116 citations
- MaxK-GNN: Extremely Fast GPU Kernel Design for Accelerating Graph Neural Networks TrainingHongwu Peng, Xi Xie, Kaustubh Shivdikar, Md Amit Hasan et al.ASPLOS 2024 · 32 citations
- Parallel Top-K Algorithms on GPU: A Comprehensive Study and New MethodsJingrong Zhang, Akira Naruse, Xipeng Li, Yong WangSC 2023 · 17 citations
Related papers
- Dr. Top-k: delegate-centric Top-k on GPUsAnil Gaihre, Da Zheng, Scott Weitze, Lingda Li et al.SC 2021 · 16 citations
- RTNN: accelerating neighbor search using hardware ray tracingYuhao ZhuPPoPP 2022 · 43 citations
- PruneGNN: Algorithm-Architecture Pruning Framework for Graph Neural Network AccelerationDeniz Gurevin, Mohsin Shan, Shaoyi Huang, Md Amit Hasan et al.HPCA 2024 · 28 citations
- BCCE: Block-Centric GPU Co-Design for Real-Time Range-Top-K Query at ScaleChengying Huan, Ziheng Meng, Zhengyi Yang, Yongchao Liu et al.HPDC 2026
- PilotANN: Memory-Bounded GPU Acceleration for Vector SearchYuntao Gui, Peiqi Yin, Xiao Yan, Chaorui Zhang et al.KDD 2026 · 5 citations
