Reproducibility in Benchmarking Parallel Fast Fourier Transform based Applications
Type
Conference PaperKAUST Department
Extreme Computing Research CenterDate
2019-04-05Online Publication Date
2019-04-05Print Publication Date
2019Permanent link to this record
http://hdl.handle.net/10754/631967
Metadata
Show full item recordAbstract
An 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.Citation
Aseeri 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.Sponsors
We thank all the authors of [2] 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.Journal
Companion of the 2019 ACM/SPEC International Conference on Performance Engineering - ICPE '19Additional Links
https://dl.acm.org/citation.cfm?doid=3302541.3313105ae974a485f413a2113503eed53cd6c53
10.1145/3302541.3313105