메뉴 건너뛰기




Volumn 4, Issue 4, 2009, Pages 386-400

High performance computing systems with various checkpointing schemes

Author keywords

Checkpoint restart model; Fault tolerance; HPC; Large scale distributed system; Reliability

Indexed keywords


EID: 77951192525     PISSN: 18419836     EISSN: 18419844     Source Type: Journal    
DOI: 10.15837/ijccc.2009.4.2455     Document Type: Article
Times cited : (15)

References (22)
  • 2
    • 28044438299 scopus 로고    scopus 로고
    • A Model for Predicting the Optimum Checkpoint Interval for Restart Dumps ICCS 2003
    • J.T. Daly, A Model for Predicting the Optimum Checkpoint Interval for Restart Dumps, ICCS 2003, LNCS 2660, Volume 4, pp. 3-12, 2003.
    • (2003) LNCS 2660 , vol.4 , pp. 3-12
    • Daly, J.T.1
  • 3
    • 51049113966 scopus 로고    scopus 로고
    • A Higher Order Estimate of the Optimum Checkpoint Interval for Restart Dumps
    • Elsevier, Amsterdam
    • J.T. Daly, A Higher Order Estimate of the Optimum Checkpoint Interval for Restart Dumps, Future Generation Computer Systems, Elsevier, Amsterdam, 2004.
    • (2004) Future Generation Computer Systems
    • Daly, J.T.1
  • 4
    • 9144223280 scopus 로고    scopus 로고
    • Checkpointing for Peta-Scale Systems: A Look into the Future of Practical Rollback Recovery
    • 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.
    • (2004) IEEE Transactions on Dependable and Secure Computing , vol.1 , Issue.2 , pp. 97-108
    • Elnozahy, E.1    Plank, J.2
  • 5
    • 0024090194 scopus 로고
    • Selection of a checkpoint interval in a critical-task environment
    • 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.
    • (1988) IEEE Transactions on Reliability , vol.37 , Issue.4 , pp. 395-400
    • Geist, R.1    Reynolds, R.2    Westall, J.3
  • 7
    • 77951202436 scopus 로고    scopus 로고
    • Data-Mining Techniques for Supporting Merging Decisions
    • L. Hancu, Data-Mining Techniques for Supporting Merging Decisions, Int. J. of Computers, Communications and Control, Vol. III (2008), pp. 322-326.
    • (2008) Int. J. of Computers, Communications and Control , vol.3 , pp. 322-326
    • Hancu, L.1
  • 8
    • 77951155491 scopus 로고    scopus 로고
    • Modelling of the Distributed Databases. A Viewpoint Mechanism of the MVDB Model's Methodology
    • 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.
    • (2008) Int. J. of Computers, Communications and Control , vol.3 , pp. 327-332
    • Hunyadi, D.I.1    Musan, M.A.2
  • 9
    • 0035390088 scopus 로고    scopus 로고
    • A Variational Calculus Approach to Optimal Checkpoint Placement
    • 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.
    • (2001) IEEE Transactions on Computers , vol.50 , Issue.7 , pp. 699-707
    • Ling, Y.1    Mi, J.2    Lin, X.3
  • 11
    • 33646721605 scopus 로고    scopus 로고
    • Distribution-Free Checkpoint Placement Algorithms Based on Min-Max Principle
    • 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.
    • (2006) IEEE Transactions on Dependable and Secure Computing , vol.3 , Issue.2 , pp. 130-140
    • Ozaki, T.1    Dohi, T.2    Okamura, H.3
  • 13
    • 0004097019 scopus 로고
    • Compressed differences: an algorithm for fast incremental checkpointing
    • 1995a University of Tennessee at Knoxville
    • 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.
    • (1995) Technical Report CS-95-302
    • Plank, J.S.1    Xu, J.2    Netzer, R.H.3
  • 14
    • 0032597646 scopus 로고    scopus 로고
    • The Average Availability of Parallel Checkpointing Systems and Its Importance in Selecting Runtime Parameters
    • Madison WI
    • 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.
    • (1999) The 29th International Symposium on Fault-Tolerant Computing , pp. 250-259
    • Plank, J.S.1    Thomason, M.A.2
  • 15
    • 1642642530 scopus 로고
    • Stochastic Processes
    • 2nd edition ISBN-10: 0471120626
    • S.M. Ross, Stochastic Processes, Wiley; 2nd edition, ISBN-10: 0471120626, 1995.
    • (1995) Wiley
    • Ross, S.M.1
  • 19
    • 84866903812 scopus 로고
    • Distributed Computing Systems and Checkpointing
    • K.F. Wong, M.A. Franklin, Distributed Computing Systems and Checkpointing, HPDC, pp. 224-233, 1993.
    • (1993) HPDC , pp. 224-233
    • Wong, K.F.1    Franklin, M.A.2
  • 20
    • 84976846528 scopus 로고
    • A first-order approximation to the optimum checkpoint interval
    • J.W. Young, A first-order approximation to the optimum checkpoint interval, Communications of ACM volume 17, Issue 9, pp. 530-531, 1974.
    • (1974) Communications of ACM , vol.17 , Issue.9 , pp. 530-531
    • Young, J.W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.