{"paper":{"title":"Resiliency in Numerical Algorithm Design for Extreme Scale Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andreas Wagner, Barbara Wohlmuth, Christian Engelmann, Daniel Drzisga, Dominik Goeddeke, Dominik Thoennes, Emmanuel Agullo, Enrique S. Quintana-Orti, Fabienne Jezequel, Florina M. Ciorba, Francesco Rizzi, Fred Fung, Hans-Joachim Bungartz, Hartwig Anzt, Keita Teranishi, Leonardo Bautista-Gomez, Linda Stals, Luca Bonaventura, Luc Giraud, Marco Heisig, Martin Schulz, Michael Obersteiner, Mirco Altenbernd, Miriam Mehl, Nathan Debardeleben, Nils Kohl, Paul Mycek, Robert Speck, Romain Lion, Samuel Thibault, Sanjay Chatterjee, Sebastian Eibl, Tommaso Benacchio, Ulrich Ruede, Wilfried N. Gansterer, Xiaoye Sherry Li","submitted_at":"2020-10-26T05:05:14Z","abstract_excerpt":"This work is based on the seminar titled ``Resiliency in Numerical Algorithm Design for Extreme Scale Simulations'' held March 1-6, 2020 at Schloss Dagstuhl, that was attended by all the authors.\n  Naive versions of conventional resilience techniques will not scale to the exascale regime: with a main memory footprint of tens of Petabytes, synchronously writing checkpoint data all the way to background storage at frequent intervals will create intolerable overheads in runtime and energy consumption. Forecasts show that the mean time between failures could be lower than the time to recover from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.13342","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.13342/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}