A highly efficient FFT using shared-memory multiplexing

DOI10.1007/978-3-319-06548-9_17zbMATH Open1317.65265OpenAlexW40470407MaRDI QIDQ5261415FDOQ5261415

Yi Yang, Huiyang Zhou

Publication date: 3 July 2015

Published in: Numerical Computations with GPUs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06548-9_17

Recommendations

• Multiprocessor FFTs
• scientific article
• scientific article; zbMATH DE number 2089181
• Communication efficient multi-processor FFT
• Four easy ways to a faster FFT

zbMATH Keywords

numerical exampleparallel computationfast Fourier transformbandwidth-limited algorithmshared-memory multiplexing

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (2)

• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• A low-memory-access length-adaptive architecture for \(2^n\)-point FFT

Uses Software

• CUDA
• OpenCL
• cuFFT

This page was built for publication: A highly efficient FFT using shared-memory multiplexing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261415)