Reproducibility in Benchmarking Parallel Fast Fourier Transform based Applications
KAUST DepartmentExtreme Computing Research Center
Online Publication Date2019-04-05
Print Publication Date2019
Permanent link to this recordhttp://hdl.handle.net/10754/631967
MetadataShow full item record
AbstractAn overview of concerns observed in allowing for reproducibility in parallel applications that heavily depend on the three dimensional distributed memory fast Fourier transform are summarized. Suggestions for reproducibility categories for benchmark results are given.
CitationAseeri S, Muite BK, Takahashi D (2019) Reproducibility in Benchmarking Parallel Fast Fourier Transform based Applications. Companion of the 2019 ACM/SPEC International Conference on Performance Engineering - ICPE ’19. Available: http://dx.doi.org/10.1145/3302541.3313105.
SponsorsWe thank all the authors of  and those who have given a presentation on their use of the FFT in the ongoing discussion at www.fft.report. We also thank Robert Henschel for an overview of the SPEC benchmarking process at the benchmarking in the data center workshop at HPC Asia 2019. We thank RIKEN for the use of the K computer, HLRS for the use of Kabuki and Hazelhen, and the KAUST Supercomputing Laboratory for the use of Shaheen II. B.K.M. was partially supported by HPC Europa 3 (INFRAIA-2016-1-730897). B.K.M. thanks H. Berger, A. Chepstov, J. Gracia and A. Jocksch for helpful hints and discussions.
JournalCompanion of the 2019 ACM/SPEC International Conference on Performance Engineering - ICPE '19