heFFTe: Highly Efficient FFT for Exascale

Alan Ayala, Stanimire Tomov, Azzam Haidar, Jack Dongarra

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Exascale computing aspires to meet the increasing demands from large scientific applications. Software targeting exascale is typically designed for heterogeneous architectures; henceforth, it is not only important to develop well-designed software, but also make it aware of the hardware architecture and efficiently exploit its power. Currently, several and diverse applications, such as those part of the Exascale Computing Project (ECP) in the United States, rely on efficient computation of the Fast Fourier Transform (FFT). In this context, we present the design and implementation of heFFTe (Highly Efficient FFT for Exascale) library, which targets the upcoming exascale supercomputers. We provide highly (linearly) scalable GPU kernels that achieve more than 40× speedup with respect to local kernels from CPU state-of-the-art libraries, and over 2× speedup for the whole FFT computation. A communication model for parallel FFTs is also provided to analyze the bottleneck for large-scale problems. We show experiments obtained on Summit supercomputer at Oak Ridge National Laboratory, using up to 24,576 IBM Power9 cores and 6,144 NVIDIA V-100 GPUs.
Original languageEnglish
Title of host publicationComputational Science – ICCS 2020. ICCS 2020
PublisherSpringer Nature
Pages262-275
DOIs
Publication statusE-pub ahead of print - 15 Jun 2020

Publication series

NameComputational Science – ICCS 2020
Volume12137
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'heFFTe: Highly Efficient FFT for Exascale'. Together they form a unique fingerprint.

Cite this