High Performance Computing Systems with Various Checkpointing Schemes
AbstractFinding the failure rate of a system is a crucial step in high performance computing systems analysis. To deal with this problem, a fault tolerant mechanism, called checkpoint/ restart technique, was introduced. However, there are additional costs to perform this mechanism. Thus, we propose two models for different schemes (full and incremental checkpoint schemes). The models which are based on the reliability of the system are used to determine the checkpoint placements. Both proposed models consider a balance of between checkpoint overhead and the re-computing time. Due to the extra costs from each incremental checkpoint during the recovery period, a method to find the number of incremental checkpoints between two consecutive full checkpoints is given. Our simulation suggests that in most cases our incremental checkpoint model can reduce the waste time more than it is reduced by the full checkpoint model. The waste times produced by both models are in the range of 2% to 28% of the application completion time depending on the checkpoint overheads.
 J.T. Daly, A Model for Predicting the Optimum Checkpoint Interval for Restart Dumps, ICCS 2003, LNCS 2660, Volume 4, pp. 3–12, 2003.
 J.T. Daly, A Higher Order Estimate of the Optimum Checkpoint Interval for Restart Dumps, Future Generation Computer Systems, Elsevier, Amsterdam, 2004.
 E. Elnozahy, J. Plank, Checkpointing for Peta-Scale Systems: A Look into the Future of Practical Rollback- Recovery, IEEE Transactions on Dependable and Secure Computing, vol.01,no.2, pp. 97-108, 2004.
 R. Geist, R. Reynolds, and J. Westall, Selection of a checkpoint interval in a critical-task environment, IEEE Transactions on Reliability, vol.37, no.4, pp. 395-400, 1988.
 I. M. Gelfand and S. V. Fomin, Calculus of Variations, Dover Publications, ISBN-10: 0486414485, 2000.
 L. Hancu, Data-Mining Techniques for Supporting Merging Decisions,Int. J. of Computers, Communications and Control,Vol. III (2008), pp. 322-326.
 D. I. Hunyadi, M. A. Musan, Modelling of the Distributed Databases. A Viewpoint Mechanism of the MVDB Model's Methodology, Int. J. of Computers, Communications and Control, Vol. III (2008),pp. 327-332.
 Y. Ling, J. Mi, and X. Lin, A Variational Calculus Approach to Optimal Checkpoint Placement, IEEE Transactions on Computers, vol. 50, no. 7, pp. 699-707, 2001.
 A.J. Oliner, L. Rudolph, and R.K. Sahoo, Cooperative Checkpointing: A Robust Approach to Large-scale Systems Reliability, Proceedings of the 20th Annual International Conference on Supercomputing (ICS), Australia, pp. 14-23, 2006.
 T. Ozaki, T. Dohi, and H. Okamura, Distribution-Free Checkpoint Placement Algorithms Based on Min-Max Principle, IEEE Transactions on Dependable and Secure Computing, Volume 3, Issue 2, pp. 130 – 140, 2006.
 A. C. Palaniswamy, and P. A. Wilsey, An analytical comparison of periodic checkpointing and incremental state saving, Proc. of the Seventh Workshop on Parallel and Distributed Simulation, California, pp. 127-134, 1993.
 J.S. Plank, J. Xu, and R.H. Netzer, 1995a. Compressed differences: an algorithm for fast incremental checkpointing, Technical Report CS-95-302, University of Tennessee at Knoxville, 1995.
 J.S. Plank, M.A. Thomason, The Average Availability of Parallel Checkpointing Systems and Its Importance in Selecting Runtime Parameters, The 29th International Symposium on Fault-Tolerant Computing, Madison, WI, pp. 250-259, 1999.
 S.M. Ross, Stochastic Processes, Wiley; 2nd edition, ISBN-10: 0471120626, 1995.
 B. Schroeder, G.A. Gibson, A large-scale study of failures in high-performance computing systems, Proceedings of International Symposium on Dependable Systems and Networks (DSN). IEEE Computer Society, pp. 249–258, 2006.
 A. Tikotekar, C. Leangsuksun, S. Scott, On the survivability of standard MPI applications, In Proceedings of 7th LCI International Conference on Linux Clusters: The HPC Revolution 2006.
 N. H. Vaidya, A case for two-level distributed recovery schemes, in Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, pp. 64–73, 1995.
 K. F. Wong, M.A. Franklin, Distributed Computing Systems and Checkpointing, HPDC, pp. 224-233, 1993.
 J.W. Young, A first-order approximation to the optimum checkpoint interval, Communications of ACM volume 17, Issue 9, pp. 530-531, 1974.
 Y. Liu, R. Nassar, C. B. Leangsuksun, N. Naksinehaboon, M. Paun, and S. L. Scott, An optimal checkpoint/ restart model for a large scale high performance computing system, in Proc. International Parallel and Distributed Processing Symposium, (Miami, Florida, 2008) pp.1-9, 2008.
 D. Zmaranda, G. Gabor, Issues on Optimality Criteria Applied in Real-Time Scheduling,Int. J. of Computers, Communications and Control, Issue 3, pp.536-540, 2008.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.