Analyzing the Performance and Accuracy of Lossy Checkpointing on Sub-Iteration of NWChem
Event Type
Registration Categories
Big Data
Data Analytics
Data Management
TimeSunday, 17 November 20194:30pm - 4:50pm
DescriptionFuture exascale systems are expected to be characterized by more frequent failures than current petascale systems. This places increased importance on the application to minimize the amount of time wasted due to recompution when recovering from a checkpoint. Typically HPC application checkpoint at iteration boundaries. However, for applications that have a high per-iteration cost, checkpointing inside the iteration limits the amount of re-computation. This paper analyzes the performance and accuracy of using lossy compressed check-pointing in the computational chemistry application NWChem. Our results indicate that lossy compression is an effective tool for reducing the sub-iteration checkpoint size. Moreover, compression error tolerances that yield acceptable deviation in accuracy and iteration count are quantified.
Back To Top Button