基于稀疏网格组合技术的可扩展容错计算
Scalable and Fault Tolerant Computation with the Sparse Grid Combination Technique
摘要:
本文继续发展[B]中最近提出的稀疏网格组合技术的容错扩展。Harding和M. Hegland,ANZIAM J.,54(CTAC2012),pp. C394-C411]。该方法是新颖的,有两个原因,第一,它提供了几个层次,其中一个可以利用并行导致大规模并行实现,第二,它提供了基于算法的容错,使解决方案仍然可以恢复,如果在计算过程中发生故障。我们提出了一个概括的组合技术的容错算法是一个后果。使用一个高性能计算机的每个节点上的故障之间的时间模型,我们提供了该算法的插值的预期误差的界限。在标量平流偏微分方程上的数值实验表明,该算法在实际应用中具有较好的容错能力。据观察,恢复时间的权衡,以降低精度的解决方案是适当的小。与传统的检查点重新启动方法应用于组合技术的比较表明,我们的方法是高度可扩展的故障的数量。
英文摘要:
This paper continues to develop a fault tolerant extension of the sparse grid combination technique recently proposed in [B. Harding and M. Hegland, ANZIAM J., 54 (CTAC2012), pp. C394-C411]. The approach is novel for two reasons, first it provides several levels in which one can exploit parallelism leading towards massively parallel implementations, and second, it provides algorithm-based fault tolerance so that solutions can still be recovered if failures occur during computation. We present a generalisation of the combination technique from which the fault tolerant algorithm is a consequence. Using a model for the time between faults on each node of a high performance computer we provide bounds on the expected error for interpolation with this algorithm. Numerical experiments on the scalar advection PDE demonstrate that the algorithm is resilient to faults on a real application. It is observed that the trade-off of recovery time to decreased accuracy of the solution is suitably small. A comparison with traditional checkpoint-restart methods applied to the combination technique show that our approach is highly scalable with respect to the number of faults.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。