Twelve Ways To Fool The Masses When Giving Parallel-In-Time Results

DOI10.1007/978-3-030-75933-9_4MaRDI QIDQ6361352arXivFDO

Authors Sebastian Götschel, Michael L. Minion, Daniel Ruprecht, Robert Speck

Publication date 23 February 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-030-75933-9_4

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

arXiv classification

cs.CE cs.NA math.NA

Abstract: Getting good speedup -- let alone high parallel efficiency -- for parallel-in-time (PinT) integration examples can be frustratingly difficult. The high complexity and large number of parameters in PinT methods can easily (and unintentionally) lead to numerical experiments that overestimate the algorithm's performance. In the tradition of Bailey's article "Twelve ways to fool the masses when giving performance results on parallel computers", we discuss and demonstrate pitfalls to avoid when evaluating performance of PinT methods. Despite being written in a light-hearted tone, this paper is intended to raise awareness that there are many ways to unintentionally fool yourself and others and that by avoiding these fallacies more meaningful PinT performance results can be obtained.

This page was built for publication: Twelve Ways To Fool The Masses When Giving Parallel-In-Time Results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6361352)