000830506 001__ 830506
000830506 005__ 20230310131344.0
000830506 0247_ $$2doi$$a10.1016/j.parco.2016.12.001
000830506 0247_ $$2ISSN$$a0167-8191
000830506 0247_ $$2ISSN$$a1872-7336
000830506 0247_ $$2WOS$$aWOS:000397367800002
000830506 0247_ $$2altmetric$$aaltmetric:8405829
000830506 037__ $$aFZJ-2017-04047
000830506 082__ $$a004
000830506 1001_ $$0P:(DE-Juel1)132268$$aSpeck, Robert$$b0$$eCorresponding author
000830506 245__ $$aToward fault-tolerant parallel-in-time integration with PFASST
000830506 260__ $$aAmsterdam [u.a.]$$bNorth-Holland, Elsevier Science$$c2017
000830506 3367_ $$2DRIVER$$aarticle
000830506 3367_ $$2DataCite$$aOutput Types/Journal article
000830506 3367_ $$0PUB:(DE-HGF)16$$2PUB:(DE-HGF)$$aJournal Article$$bjournal$$mjournal$$s1497010614_12007
000830506 3367_ $$2BibTeX$$aARTICLE
000830506 3367_ $$2ORCID$$aJOURNAL_ARTICLE
000830506 3367_ $$00$$2EndNote$$aJournal Article
000830506 520__ $$aWe 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.
000830506 536__ $$0G:(DE-HGF)POF3-511$$a511 - Computational Science and Mathematical Methods (POF3-511)$$cPOF3-511$$fPOF III$$x0
000830506 536__ $$0G:(GEPRIS)450829162$$aDFG project 450829162 - Raum-Zeit-parallele Simulation multimodale Energiesystemen (450829162)$$c450829162$$x1
000830506 588__ $$aDataset connected to CrossRef
000830506 7001_ $$0P:(DE-HGF)0$$aRuprecht, Daniel$$b1
000830506 773__ $$0PERI:(DE-600)1466340-5$$a10.1016/j.parco.2016.12.001$$gVol. 62, p. 20 - 37$$p20 - 37$$tParallel computing$$v62$$x0167-8191$$y2017
000830506 8564_ $$uhttps://juser.fz-juelich.de/record/830506/files/1-s2.0-S0167819116301338-main.pdf$$yRestricted
000830506 8564_ $$uhttps://juser.fz-juelich.de/record/830506/files/1-s2.0-S0167819116301338-main.gif?subformat=icon$$xicon$$yRestricted
000830506 8564_ $$uhttps://juser.fz-juelich.de/record/830506/files/1-s2.0-S0167819116301338-main.jpg?subformat=icon-1440$$xicon-1440$$yRestricted
000830506 8564_ $$uhttps://juser.fz-juelich.de/record/830506/files/1-s2.0-S0167819116301338-main.jpg?subformat=icon-180$$xicon-180$$yRestricted
000830506 8564_ $$uhttps://juser.fz-juelich.de/record/830506/files/1-s2.0-S0167819116301338-main.jpg?subformat=icon-640$$xicon-640$$yRestricted
000830506 8564_ $$uhttps://juser.fz-juelich.de/record/830506/files/1-s2.0-S0167819116301338-main.pdf?subformat=pdfa$$xpdfa$$yRestricted
000830506 909CO $$ooai:juser.fz-juelich.de:830506$$pVDB
000830506 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)132268$$aForschungszentrum Jülich$$b0$$kFZJ
000830506 9131_ $$0G:(DE-HGF)POF3-511$$1G:(DE-HGF)POF3-510$$2G:(DE-HGF)POF3-500$$3G:(DE-HGF)POF3$$4G:(DE-HGF)POF$$aDE-HGF$$bKey Technologies$$lSupercomputing & Big Data$$vComputational Science and Mathematical Methods$$x0
000830506 9141_ $$y2017
000830506 915__ $$0StatID:(DE-HGF)0100$$2StatID$$aJCR$$bPARALLEL COMPUT : 2015
000830506 915__ $$0StatID:(DE-HGF)0200$$2StatID$$aDBCoverage$$bSCOPUS
000830506 915__ $$0StatID:(DE-HGF)0300$$2StatID$$aDBCoverage$$bMedline
000830506 915__ $$0StatID:(DE-HGF)0600$$2StatID$$aDBCoverage$$bEbsco Academic Search
000830506 915__ $$0StatID:(DE-HGF)0030$$2StatID$$aPeer Review$$bASC
000830506 915__ $$0StatID:(DE-HGF)0199$$2StatID$$aDBCoverage$$bThomson Reuters Master Journal List
000830506 915__ $$0StatID:(DE-HGF)0111$$2StatID$$aWoS$$bScience Citation Index Expanded
000830506 915__ $$0StatID:(DE-HGF)0150$$2StatID$$aDBCoverage$$bWeb of Science Core Collection
000830506 915__ $$0StatID:(DE-HGF)1160$$2StatID$$aDBCoverage$$bCurrent Contents - Engineering, Computing and Technology
000830506 915__ $$0StatID:(DE-HGF)9900$$2StatID$$aIF < 5
000830506 920__ $$lyes
000830506 9201_ $$0I:(DE-Juel1)JSC-20090406$$kJSC$$lJülich Supercomputing Center$$x0
000830506 980__ $$ajournal
000830506 980__ $$aVDB
000830506 980__ $$aI:(DE-Juel1)JSC-20090406
000830506 980__ $$aUNRESTRICTED