What is it about?
This work introduces RadiK, a scalable and optimized GPU-parallel radix top-k selection that supports significantly larger k values than existing methods without compromising efficiency, regardless of input length and batch size. RadiK incorporates a novel optimization framework tailored for high memory bandwidth and resource utilization, achieving up to 2.5x speedup over the prior art for non-batch queries and up to 4.8x speedup for batch queries. In addition, we propose an adaptive scaling technique that strengthens robustness, which further provides up to 2.7x speedup on highly adversarial input distributions.
Featured Image
Photo by Willian Justen de Vasconcellos on Unsplash
Read the Original
This page is a summary of: RadiK: Scalable and Optimized GPU-Parallel Radix Top-K Selection, May 2024, ACM (Association for Computing Machinery),
DOI: 10.1145/3650200.3656596.
You can read the full text:
Contributors
The following have contributed to this page







