Fault resilient domain decomposition preconditioner for PDES

Published

Journal Article

© 2015 Society for Industrial and Applied Mathematics. The move towards extreme-scale computing platforms challenges scientific simulations in many ways. Given the recent tendencies in computer architecture development, one needs to reformulate legacy codes in order to cope with large amounts of communication, system faults, and requirements of low-memory usage per core. In this work, we develop a novel framework for solving PDEs via domain decomposition that reformulates the solution as a state of knowledge with a probabilistic interpretation. Such reformulation allows resiliency with respect to potential faults without having to apply fault detection, avoids unnecessary communication, and is generally well-suited for rigorous uncertainty quantification studies that target improvements of predictive fidelity of scientific models. We demonstrate our algorithm for one-dimensional PDE examples where artificial faults have been implemented as bit flips in the binary representation of subdomain solutions.

Full Text

Cited Authors

  • Sargsyan, K; Rizzi, F; Mycek, P; Safta, C; Morris, K; Najm, H; Le Maître, O; Knio, O; Debusschere, B

Published Date

  • January 1, 2015

Published In

Volume / Issue

  • 37 / 5

Start / End Page

  • A2317 - A2345

Electronic International Standard Serial Number (EISSN)

  • 1095-7200

International Standard Serial Number (ISSN)

  • 1064-8275

Digital Object Identifier (DOI)

  • 10.1137/15M1014474

Citation Source

  • Scopus