Performance Implications of Periodic Checkpointing on Large-Scale Cluster Systems

Citations Over TimeTop 10% of 2005 papers

Abstract

Large-scale systems like BlueGene/L are susceptible to a number of software and hardware failures that can affect system performance. Periodic application checkpointing is a common technique for mitigating the amount of work lost due to job failures, but its effectiveness under realistic circumstances has not been studied. In this paper, we analyze the system-level performance of periodic application checkpointing using parameters similar to those projected for BlueGene/L systems. Our results reflect simulations on a toroidal interconnect architecture, using a real job log from a machine similar to BlueGene/L, and with a real failure distribution from a large-scale cluster. Our simulation studies investigate the impact of parameters such as checkpoint overhead and checkpoint interval on a number of performance metrics, including bounded slowdown, system utilization, and total work lost. The results suggest that periodic checkpointing may not be an effective way to improve the average bounded slowdown or average system utilization metrics, though it reduces the amount of work lost due to failures. We show that overzealous checkpointing with high overhead can amplify the effects of failures. The study also suggests that new metrics and checkpointing techniques may be required to effectively handle job failures on large-scale machines like BlueGene/L.

Related Papers

• → On Bounded Functions with Bounded nth Differences(1992)16 cited
• → Stability of Control Systems with Multiple Sector-Bounded Nonlinearities for Inputs Having Bounded Magnitude and Bounded Slope(2023)1 cited
• → Bounded-Input Bounded-Output Stability of Damped Linear Strings(1993)
• → On the conditional plurisubharmonic envelopes of bounded functions(2020)
• → Uniform a priori estimates for positive solutions of the Lane-Emden system in the plane(2022)