SPBC: leveraging the characteristics of MPI HPC applications for scalable checkpointing

  • Authors:

  • Thomas Ropars;Tatiana V. Martsinkevich;Amina Guermouche;André Schiper;Franck Cappello

  • Affiliations:

  • École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland;INRIA, University of Paris Sud, Paris, France;Université de Versailles, Versailles, France;École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland;Argonne National Laboratory, Argonne

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

The high failure rate expected for future supercomputers requires the design of new fault tolerant solutions. Most checkpointing protocols are designed to work with any message-passing application but suffer from scalability issues at extreme scale. We take a different approach: We identify a property common to many HPC applications, namely channel-determinism, and introduce a new partial order relation, called always-happens-before relation, between events of such applications. Leveraging these two concepts, we design a protocol that combines an unprecedented set of features. Our protocol called SPBC combines in a hierarchical way coordinated checkpointing and message logging. It is the first protocol that provides failure containment without logging any information reliably apart from process checkpoints, and this, without penalizing recovery performance. Experiments run with a representative set of HPC workloads demonstrate a good performance of our protocol during both, failure-free execution and recovery.