Options
Toward fault-tolerant parallel-in-time integration with PFASST
Publikationstyp
Journal Article
Date Issued
2017-02
Sprache
English
Author(s)
Journal
Volume
62
Start Page
20
End Page
37
Citation
Parallel Computing 62: 20-37 (2017)
Publisher DOI
Scopus ID
ArXiv ID
Peer Reviewed
true
We introduce and analyze different strategies for the parallel-in-time integration method PFASST to recover from hard faults and subsequent data loss. Since PFASST stores solutions at multiple time steps on different processors, information from adjacent steps can be used to recover after a processor has failed. PFASST's multi-level hierarchy allows to use the coarse level for correcting the reconstructed solution, which can help to minimize overhead. A theoretical model is devised linking overhead to the number of additional PFASST iterations required for convergence after a fault. The potential efficiency of different strategies is assessed in terms of required additional iterations for examples of diffusive and advective type.
Subjects
Algorithm-based fault tolerance
Boussinesq equations
Gray–Scott model
Parallel-in-time integration
Resilience
Computer Science - Distributed; Parallel; and Cluster Computing
Computer Science - Distributed; Parallel; and Cluster Computing
DDC Class
004: Computer Sciences