Fault Tolerant Computation with the Sparse Grid Combination Technique

DOI10.1137/140964448zbMath1320.65206arXiv1404.2670OpenAlexW210390770MaRDI QIDQ5254778

No author found.

Publication date: 10 June 2015

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.2670

zbMATH Keywords

parallel algorithmsalgorithm-based fault toleranceexascale computingsparse grid combination technique

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05)

Related Items (3)

A Dimension-Oblivious Domain Decomposition Method Based on Space-Filling Curves ⋮ Resilience for Massively Parallel Multigrid Solvers ⋮ A Massively-Parallel, Fault-Tolerant Solver for High-Dimensional PDEs

Cites Work

• The combination technique and some generalisations
• Probability and Statistics with Reliability, Queuing and Computer Science Applications
• Algorithm-Based Fault Tolerance for Matrix Operations
• A robust combination technique
• Reducibility among Combinatorial Problems
• Robust Solutions to PDEs with Multiple Grids
• Sparse grids
• Unnamed Item
• Unnamed Item

This page was built for publication: Fault Tolerant Computation with the Sparse Grid Combination Technique