메뉴 건너뛰기




Volumn , Issue , 2010, Pages 29-34

See applications run and throughput jump: The case for redundant computing in HPC

Author keywords

[No Author keywords available]

Indexed keywords

BREAK DOWN; CHECKPOINT/RESTART; COMPUTING SYSTEM; COST EFFECTIVE; LARGE SYSTEM; LOST WORK; ORDER OF MAGNITUDE; REDUNDANT COMPUTATION; SYSTEM THROUGHPUT;

EID: 77956584397     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSNW.2010.5542625     Document Type: Conference Paper
Times cited : (14)

References (12)
  • 1
    • 28044460018 scopus 로고    scopus 로고
    • A higher order estimate of the optimum checkpoint interval for restart dumps
    • J. T. Daly. A higher order estimate of the optimum checkpoint interval for restart dumps. Future Gener. Comput. Syst., 22(3):303-312, 2006.
    • (2006) Future Gener. Comput. Syst. , vol.22 , Issue.3 , pp. 303-312
    • Daly, J.T.1
  • 2
    • 9144223280 scopus 로고    scopus 로고
    • Checkpointing for peta-scale systems: A look into the future of practical rollback-recovery
    • Apr.
    • E. Elnozahy and J. Plank. Checkpointing for peta-scale systems: a look into the future of practical rollback-recovery. Dependable and Secure Computing, IEEE Transactions on, 1(2):97-108, Apr. 2004.
    • (2004) Dependable and Secure Computing, IEEE Transactions on , vol.1 , Issue.2 , pp. 97-108
    • Elnozahy, E.1    Plank, J.2
  • 7
    • 0344850282 scopus 로고
    • A generalized birthday problem
    • June
    • F. H. Mathis. A generalized birthday problem. SIAM Review, 33(2):265-270, June 1991.
    • (1991) SIAM Review , vol.33 , Issue.2 , pp. 265-270
    • Mathis, F.H.1
  • 11
    • 77956579585 scopus 로고    scopus 로고
    • Sandia National Laboratory, Nov. 6 2008
    • Sandia National Laboratory. Mantevo project home page. https://software.sandia.gov/mantevo Nov. 6 2008.
    • Mantevo Project Home Page


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