Compiler-enhanced incremental checkpointing for OpenMP applications

As modern supercomputing systems reach the peta-flop performance range, they grow in both size and complexity. This makes them increasingly vulnerable to failures from a variety of causes. Checkpointing is a popular technique for tolerating such failures, enabling applications to periodically save their state and restart computation after a failure. Although a variety of automated system-level checkpointing solutions are currently available to HPC users, manual application-level checkpointing remains more popular due to its superior performance. This paper improves performance of automated checkpointing via a compiler analysis for incremental checkpointing. This analysis, which works with both sequential and OpenMP applications, significantly reduces checkpoint sizes and enables asynchronous checkpointing.

• Type: Conference
• Year: 2009
• Where: IPPS
• Authors: Greg Bronevetsky, Daniel Marques, Keshav Pingali, Sally A. McKee, Radu Rugina
• Keywords: Distributed And Parallel Computing, IPPS 2009, Manual Application-level Checkpointing, Modern Supercomputing Systems, Peta-flop Performance Range