mlsanityData to 7 Oct 2026

cuFINUFFT: a load-balanced GPU library for general-purpose nonuniform FFTs

arXiv 2102.08463 ↗First posted 16 Feb 2021cs.DC cs.MS cs.NAcited by 11

Not on the map. Why?

Abstract (arXiv)

Nonuniform fast Fourier transforms dominate the computational cost in many applications including image reconstruction and signal processing. We thus present a general-purpose GPU-based CUDA library for type 1 (nonuniform to uniform) and type 2 (uniform to nonuniform) transforms in dimensions 2 and 3, in single or double precision. It achieves high performance for a given user-requested accuracy, regardless of the distribution of nonuniform points, via cache-aware point reordering, and load-balanced blocked spreading in shared memory. At low accuracies, this gives on-GPU throughputs around 109 nonuniform points per second, and (even including host-device transfer) is typically 4-10× faster than the latest parallel CPU code FINUFFT (at 28 threads). It is competitive with two established GPU codes, being up to 90× faster at high accuracy and/or type 1 clustered point distributions. Finally we demonstrate a 5-12× speedup versus CPU in an X-ray diffraction 3D iterative reconstruction task at 10-12 accuracy, observing excellent multi-GPU weak scaling up to one rank per GPU.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Feb 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 3; 2025: 3; 2026: 1.

11 papers.