메뉴 건너뛰기




Volumn 1998-January, Issue , 1998, Pages 358-363

How safe is probabilistic checkpointing?

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE;

EID: 85043362389     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FTCS.1998.689486     Document Type: Conference Paper
Times cited : (11)

References (11)
  • 1
    • 0004096191 scopus 로고    scopus 로고
    • A Survey of rollback-recovery protocols in message-passing systems
    • Department of Computer Science, Carnegie Mellon University September
    • E.N. Elnozahy, D.B. Johnson and Y-M. Wang. "A Survey of Rollback-Recovery Protocols in Message-Passing Systems, " Technical Report CMU-CS-96-181, Department of Computer Science, Carnegie Mellon University, September 1996.
    • (1996) Technical Report CMU-CS-96-181
    • Elnozahy, E.N.1    Johnson, D.B.2    Wang, Y.-M.3
  • 6
    • 0004097019 scopus 로고
    • Compressed differences: An algorithm for fast incremental checkpointing
    • University of Tennessee at Knoxville August
    • J.S. Plank, Jian Xu, R.B. Netzer, "Compressed Differences: An Algorithm for Fast Incremental Checkpointing, " Technical Report CS-95-302, University of Tennessee at Knoxville, August 1995.
    • (1995) Technical Report CS-95-302
    • Plank, J.S.1    Xu, J.2    Netzer, R.B.3


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