Parallel Fast Fourier Transforms (PFFT18)
In supercomputing, FFT is an important and fundamental library for scientific and technical computing. Current hardware trends may make some Fourier transform algorithms somewhat inefficient. For papers, besides FFT applications we consider works on present status of the FFT libraries, alternative approximate Fourier transforms, alternate hardware designs and methods to compare performance of FFT, and alternative algorithms that will be useful in advancing the field
We aim to explore how FFT could be implemented efficiently on large number of accelerators.
Organizer | Affiliation |
---|---|
Samar Aseeri | King Abdullah University of Science and Technology |
Hari Sundar | University of Utah |
Daisuke Takahashi | University of Tsukuba |
Mahendra K. Verma | Indian Institute of Technology Kanpur |
TPC | Affiliation |
---|---|
Samar Aseeri | King Abdullah University of Science and Technology |
Jens Henrik Göbbert | Jülich Supercomputing Center |
Ning Li | NAG |
Benson Muite | University of Tartu |
Dmitry Pekurovsky | San Diego Supercomputing Center |
Hari Subramoni | Ohio State University |
Hari Sundar | University of Utah |
Daisuke Takahashi | University of Tsukuba |
Ekaterina Tyutlyaeva | RSC Technologies |
Mahendra K. Verma\ a> | Indian Institute of Technology Kanpur |
Yu Feng | Berkeley Center for Cosmological Physics |
Speakers | Talk Type | Affiliation | Presentation |
---|---|---|---|
Mahendra K. Verma | Keynote | Indian Institute of Technology Kanpur | Slides |
Daisuke Takahashi | Invited | University of Tsukuba | Slides |
Anumeena Sorna | Contributed | National Institute of Technology Tiruchirappalli | Slides |
Upasana Sridhar | Contributed | PES University | Slides |
Anando Gopal Chatterjee | Invited | IIT Kanpur | Slides |
Anando Gopal Chatterjee on behalf of Ravi Reddy | Contributed | University College Dublin | Slides |