Submitted by scrawford on
|Title||heFFTe: Highly Efficient FFT for Exascale (Poster)|
|Year of Publication||2020|
|Authors||Ayala, A., S. Tomov, A. Haidar, and J. Dongarra|
|Event||SIAM Conference on Parallel Processing for Scientific Computing (SIAM PP20)|
|Event Location||Seattle, WA|
Considered one of the top 10 algorithms of the 20th century, the Fast Fourier Transform (FFT) is widely used by applications in science and engineering. Large scale parallel applications targeting exascale, such as those part of the DOE Exascale Computing Project (ECP), are designed for heterogeneous architectures and, currently, more than a dozen ECP applications use FFTs in their codes. To address the applications needs, we developed the highly efficient FFTs for exascale (heFFTe) library. The heFFTe library release features very good weak and strong scalability and performance that is close to 90% of the roofline peak performance. We present these performance results on the Summit supercomputer. heFFTe is also integrated in a number of applications and we present how the overall performance gets improved by using hFFTe. Performance model, limitations, and challenges are discussed for current and upcoming computer architectures.