Design and modeling of a non-blocking checkpointing system

  • Authors:
  • Kento Sato;Naoya Maruyama;Kathryn Mohror;Adam Moody;Todd Gamblin;Bronis R. de Supinski;Satoshi Matsuoka

  • Affiliations:
  • Tokyo Institute of Technology, Ohokayama, Meguro-ku, Tokyo Japan;Advanced Institute for Computational Science RIKEN, Minatojima-minami-machi, Chuo-ku, Kobe, Hyogo, Japan;Lawrence Livermore National Laboratory, Livermore, CA;Lawrence Livermore National Laboratory, Livermore, CA;Lawrence Livermore National Laboratory, Livermore, CA;Lawrence Livermore National Laboratory, Livermore, CA;Global Scientific Information and Computing Center, Tokyo Institute of Technology, Ohokayama, Meguro-ku, Tokyo Japan

  • Venue:
  • SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

As the capability and component count of systems increase, the MTBF decreases. Typically, applications tolerate failures with checkpoint/restart to a parallel file system (PFS). While simple, this approach can suffer from contention for PFS resources. Multi-level checkpointing is a promising solution. However, while multi-level checkpointing is successful on today's machines, it is not expected to be sufficient for exascale class machines, which are predicted to have orders of magnitude larger memory sizes and failure rates. Our solution combines the benefits of non-blocking and multi-level checkpointing. In this paper, we present the design of our system and model its performance. Our experiments show that our system can improve efficiency by 1.1 to 2.0x on future machines. Additionally, applications using our checkpointing system can achieve high efficiency even when using a PFS with lower bandwidth.