Critique of 'Planetary Normal Mode Computation: Parallel Algorithms, Performance, and Reproducibility' by SCC Team From University of Washington

Autor:	Andrei Karavanov, Andrew Lumsdaine, Sungchan Park, Matthew Cinnamon, David T.L. Liu, Thorne Garvin, Darius Strobeck
Rok vydání:	2021
Předmět:	Computational Theory and Mathematics Xeon Hardware and Architecture Normal mode Computer science Computation Signal Processing Scalability Parallel algorithm Degree of a polynomial Filter (signal processing) Parallel computing Scaling
Zdroj:	IEEE Transactions on Parallel and Distributed Systems. 32:2639-2642
ISSN:	2161-9883 1045-9219
DOI:	10.1109/tpds.2021.3051943
Popis:	One of the tasks for the SC19 Student Cluster Competition is to reproduce the results in the reproducibility challenge article “Computing Planetary Interior Normal Modes with a Highly Parallel Polynomial Filtering Eigensolver”, by J. Shi et al. , which describes a highly parallel algorithm for computing planetary normal modes. In running experiments from the article, we study the weak and strong scalability of the algorithm, as well as the relationship between model size, degree of polynomial filter, and execution time. We investigate these findings on a two-node, 64-core Intel Skylake-based Xeon cluster. Unfortunately, we are able to confirm some, but not all, of the original findings, with discrepancies possibly due to a low number of experimental runs due to competition time limits as well as nonuniform scaling of compute resources.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e99d2d30adee930f735d546411d7e9db https://doi.org/10.1109/tpds.2021.3051943 Zobrazit plný text záznamu