| Home > Publications database > Twelve Ways to Fool the Masses When Giving Parallel-in-Time Results > print |
| 001 | 901886 | ||
| 005 | 20230310131336.0 | ||
| 020 | _ | _ | |a 978-3-030-75932-2 (print) |
| 020 | _ | _ | |a 978-3-030-75933-9 (electronic) |
| 024 | 7 | _ | |a 10.1007/978-3-030-75933-9_4 |2 doi |
| 024 | 7 | _ | |a 2128/28801 |2 Handle |
| 024 | 7 | _ | |a WOS:000696174000004 |2 WOS |
| 037 | _ | _ | |a FZJ-2021-03894 |
| 041 | _ | _ | |a English |
| 100 | 1 | _ | |a Götschel, Sebastian |0 P:(DE-HGF)0 |b 0 |
| 111 | 2 | _ | |a 9th Workshop on Parallel-in-Time Integration |g PinT9 |c online |d 2020-06-08 - 2020-06-12 |w online |
| 245 | _ | _ | |a Twelve Ways to Fool the Masses When Giving Parallel-in-Time Results |
| 260 | _ | _ | |a Cham |c 2021 |b Springer International Publishing |
| 295 | 1 | 0 | |a Parallel-in-Time Integration Methods |
| 300 | _ | _ | |a 81 - 94 |
| 336 | 7 | _ | |a CONFERENCE_PAPER |2 ORCID |
| 336 | 7 | _ | |a Conference Paper |0 33 |2 EndNote |
| 336 | 7 | _ | |a INPROCEEDINGS |2 BibTeX |
| 336 | 7 | _ | |a conferenceObject |2 DRIVER |
| 336 | 7 | _ | |a Output Types/Conference Paper |2 DataCite |
| 336 | 7 | _ | |a Contribution to a conference proceedings |b contrib |m contrib |0 PUB:(DE-HGF)8 |s 1634307792_15631 |2 PUB:(DE-HGF) |
| 336 | 7 | _ | |a Contribution to a book |0 PUB:(DE-HGF)7 |2 PUB:(DE-HGF) |m contb |
| 490 | 0 | _ | |a Springer Proceedings in Mathematics & Statistics |v 356 |
| 520 | _ | _ | |a 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 the 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. |
| 536 | _ | _ | |a 5112 - Cross-Domain Algorithms, Tools, Methods Labs (ATMLs) and Research Groups (POF4-511) |0 G:(DE-HGF)POF4-5112 |c POF4-511 |x 0 |f POF IV |
| 536 | _ | _ | |a DFG project 450829162 - Raum-Zeit-parallele Simulation multimodale Energiesystemen (450829162) |0 G:(GEPRIS)450829162 |c 450829162 |x 1 |
| 588 | _ | _ | |a Dataset connected to CrossRef Book Series, Journals: juser.fz-juelich.de |
| 700 | 1 | _ | |a Minion, Michael |0 P:(DE-HGF)0 |b 1 |e Corresponding author |
| 700 | 1 | _ | |a Ruprecht, Daniel |0 P:(DE-HGF)0 |b 2 |
| 700 | 1 | _ | |a Speck, Robert |0 P:(DE-Juel1)132268 |b 3 |
| 773 | _ | _ | |a 10.1007/978-3-030-75933-9_4 |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/901886/files/12_ways_new.pdf |y OpenAccess |
| 909 | C | O | |o oai:juser.fz-juelich.de:901886 |p openaire |p open_access |p VDB |p driver |p dnbdelivery |
| 910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 3 |6 P:(DE-Juel1)132268 |
| 913 | 1 | _ | |a DE-HGF |b Key Technologies |l Engineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action |1 G:(DE-HGF)POF4-510 |0 G:(DE-HGF)POF4-511 |3 G:(DE-HGF)POF4 |2 G:(DE-HGF)POF4-500 |4 G:(DE-HGF)POF |v Enabling Computational- & Data-Intensive Science and Engineering |9 G:(DE-HGF)POF4-5112 |x 0 |
| 914 | 1 | _ | |y 2021 |
| 915 | _ | _ | |a OpenAccess |0 StatID:(DE-HGF)0510 |2 StatID |
| 920 | _ | _ | |l yes |
| 920 | 1 | _ | |0 I:(DE-Juel1)JSC-20090406 |k JSC |l Jülich Supercomputing Center |x 0 |
| 980 | _ | _ | |a contrib |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a UNRESTRICTED |
| 980 | _ | _ | |a contb |
| 980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| 980 | 1 | _ | |a FullTexts |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|