William M. Jones
ABSTRACT
As computational clusters rapidly grow in both size and complexity, system reliability and, in particular, application resilience have become increasingly important factors to consider in maintaining efficiency and providing improved computational performance over predecessor systems. One commonly used mechanism for providing application fault tolerance in parallel systems is the use of checkpointing.
By making use of a multi-cluster simulator, we study the impact of sub-optimal checkpoint intervals on overall application efficiency. By using a model of a 1926 node cluster and workload statistics from Los Alamos National Laboratory to parameterize the simulator, we find that dramatically overestimating the AMTTI has a fairly minor impact on application efficiency while potentially having a much more severe impact on user-centric performance metrics such a queueing delay. We compare and contrast these results with the trends predicted by an analytical model.
- }}J. T. Daly. A Higher Order Estimate of the Optimum Checkpoint Interval for Restart Dumps. Future Generation Computer Systems, 22:300--312, 2006. Google Scholar
Digital Library
- }}J. T. Daly. Methodology and metrics for quantifying application throughput. In Proceedings of the Nuclear-Explosives Code Developers Conference, 2006.Google Scholar
- }}E. Hendriks. Bproc: the beowulf distributed process space. In ICS '02: Proceedings of the 16th international conference on Supercomputing, pages 129--136, New York, NY, USA, 2002. ACM. Google ScholarDigital Library
- }}BeoSim Website. http://www.parl.clemson.edu/beosim.Google Scholar
- }}W. M. Jones. Network-aware selective job checkpoint and migration to enhance co-allocation in multi-cluster systems. In Journal of Concurrency and Computation: Practice and Experience, volume 21, pages 1672--1691. John Wiley and Sons, Ltd., September 2009. Google ScholarDigital Library
- }}W. M. Jones, J. T. Daly, and N. A. DeBardeleben. Application resilience: Making progress in spite of failure. In The Workshop on Resilience held in conjunction with the IEEE International Conference on Cluster Computing and the Grid (CCGRID 2008), pages 789--794, May 2008. Google ScholarDigital Library
- }}W. M. Jones, L. W. Pang, D. Stanzione, and W. B. Ligon III. Characterization of bandwidth-aware meta-schedulers for co-allocating jobs across multiple clusters. In Journal of Supercomputing, Special Issue on the Evaluation of Grid and Cluster Computing Systems, volume 34, pages 135--163. Springer Science and Business Media B. V, November 2005. Google ScholarDigital Library
- }}J. W. Young. A first-order approximation to the optimum checkpoint interval. In Communications of the ACM, pages 530--531, September 1974. Google ScholarDigital Library
Index Terms
- Impact of sub-optimal checkpoint intervals on application efficiency in computational clusters
Recommendations
Application monitoring and checkpointing in HPC: looking towards exascale systems
ACM-SE '12: Proceedings of the 50th Annual Southeast Regional ConferenceAs computational cluster computers rapidly grow in both size and complexity, system reliability and, in particular, application resilience have become increasingly important factors to consider in maintaining efficiency and providing improved compute ...
An Examination of the Impact of Failure Distribution on Coordinated Checkpoint/Restart
FTXS '16: Proceedings of the ACM Workshop on Fault-Tolerance for HPC at Extreme ScaleFault tolerance is a key challenge to building the first exa\-scale system. To understand the potential impacts of failures on next-generation systems, significant effort has been devoted to collecting, characterizing and analyzing failures on current ...
A Checkpointing Method with Small Checkpoint Latency
The cost of checkpointing consists of checkpoint overhead and checkpoint latency. The former is the time to stop the process for checkpointing. The latter is the time to complete the checkpointing including background checkpointing which stores memory ...
Comments