Next Generation FFT Algorithms in Theory and Practice: Parallel Implementations, Sparse FFTs, and Applications
The fast Fourier Transform (FFT) is an algorithm used in a wide variety of applications, yet does not make optimal use of many current hardware platforms. Hardware utilization performance on its own does not however imply optimal problem solving. The purpose of this minisymposium is to enable exchange of information between people working on alternative FFT algorithms such as sparse and non uniform FFTs, to those working on FFT implementations, in particular for parallel hardware.
We aim to explore how FFT could be implemented efficiently on large number of accelerators.
| Organizer | Affiliation |
|---|---|
| Daisuke Takahashi | University of Tsukuba |
| Mark Iwen | Michigan State University |
| Samar Aseeri | King Abdullah University of Science and Technology |
| Benson K. Muite | University of Tartu |
| Speaker | Affiliation | Presentation |
|---|---|---|
| Daisuke Takahashi | University of Tsukuba | Slides |
| Mark Iwen | Michigan State University | Slides |
| Alexander Kalinkin | Intel Corporation | |
| Sina Bittens | University of Goettingen | Slides | Samar Aseeri | King Abdullah University of Science and Technology |
| Bosu Choi | University of Texas at Austin | Slides |
| Toni Volkmer | Chemnitz University of Technology | Slides |
| Henry A. Boateng | Bates College |