田凯, 卢宇彤, 所光. 容错的并行多重网格算法[J]. 微电子学与计算机, 2012, 29(9): 1-4.
引用本文: 田凯, 卢宇彤, 所光. 容错的并行多重网格算法[J]. 微电子学与计算机, 2012, 29(9): 1-4.
TIAN Kai, LU Yu-tong, SUO Guang. Fault Tolerant Parallel Multiple Grid Algorithm[J]. Microelectronics & Computer, 2012, 29(9): 1-4.
Citation: TIAN Kai, LU Yu-tong, SUO Guang. Fault Tolerant Parallel Multiple Grid Algorithm[J]. Microelectronics & Computer, 2012, 29(9): 1-4.

容错的并行多重网格算法

Fault Tolerant Parallel Multiple Grid Algorithm

  • 摘要: 高性能计算机上并行程序用到的结点越来越多,而在程序运行期间中发生结点失效的概率也随之增大.对于计算时间很长的程序,容忍结点失效的容错能力显得尤为重要.并行多重网格算法 (MG)被广泛用于求解大型工程和物理问题中的偏微分方程组的数值解.为了实现MG算法的容错能力,提出了一种基于容错MPI的容错并行多重网格算法FT-MG.实验结果表明:FT-MG算法在引入少许开销的条件下实现了MG算法的容错能力.

     

    Abstract: As the number of nodes used in high performance applications increases, the probability that failures occur in the computing processes of applications increases.For long running applications it is essential that fault tolerance be used to survive fail-stop failures.The parallel multiple grid algorithm (MG) is widely used to solve the PDEs in large-scale project and physical problems.To implement the fault tolerant ability of MG algorithm, we design a fault tolerance algorithm (named FT-MG) based on fault tolerance MPI.Experimental results prove the fault tolerance ability of FT-VMG and demonstrate that the fault tolerant overhead of FT-MG is pretty small.

     

/

返回文章
返回