Main Birds of Feather at Supercomputing 2017 Minisymposium at SIAM Parallel Processing 2018 Birds of Feather at International Supercomputing Conference 2018 Workshop at HiPC 2018 Minisymposium at SIAM CSE19 Press Project Poster Contact us

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.

Conference page.

Session 1.

Session 2.

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
Daisuke Takahashi University of Tsukuba
Mark Iwen Michigan State University
Alexander Kalinkin Intel Corporation
Sina Bittens University of Goettingen
Samar Aseeri King Abdullah University of Science and Technology
Bosu Choi University of Texas at Austin
Toni Volkmer Chemnitz University of Technology
Henry A. Boateng Bates College