arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.05038cs.DC
收藏

基于动态数据集的HPC应用的应用级差分检查点

Application-Level Differential Checkpointing for HPC Applications with Dynamic Datasets

Kai Keller, Leonardo Bautista Gomez

摘要:

高性能计算(HPC)需要弹性技术,如检查点,以容忍超级计算机中的故障。随着超级计算机中节点和内存数量的不断增加,检查点数据的大小也急剧增加,有时会导致I/O瓶颈。差分检查点(Differential checkpointing,dCP)旨在通过只写入数据差异来最小化检查点开销。这通常在内存页面级别实现,有时还辅以哈希算法。然而,这样的技术是无法应付动态大小的数据集。在这项工作中,我们提出了一种新的dCP实现与一种新的文件格式,允许受保护的数据集的碎片,以支持动态大小。我们使用哈希算法识别脏数据块。为了评估dCP的性能,我们移植了HPC应用程序xPic,LULESH 2.0和Heat 2D,并分析了它们使用dCP减少I/O的潜力以及这种数据减少如何影响检查点性能。在我们的实验中,我们实现了高达62%的检查点时间减少。

英文摘要:

High-performance computing (HPC) requires resilience techniques such as checkpointing in order to tolerate failures in supercomputers. As the number of nodes and memory in supercomputers keeps on increasing, the size of checkpoint data also increases dramatically, sometimes causing an I/O bottleneck. Differential checkpointing (dCP) aims to minimize the checkpointing overhead by only writing data differences. This is typically implemented at the memory page level, sometimes complemented with hashing algorithms. However, such a technique is unable to cope with dynamic-size datasets. In this work, we present a novel dCP implementation with a new file format that allows fragmentation of protected datasets in order to support dynamic sizes. We identify dirty data blocks using hash algorithms. In order to evaluate the dCP performance, we ported the HPC applications xPic, LULESH 2.0 and Heat2D and analyze them regarding their potential of reducing I/O with dCP and how this data reduction influences the checkpoint performance. In our experiments, we achieve reductions of up to 62% of the checkpoint time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑