Application-driven coordination-free distributed checkpointing

Adnan Agbaria, William H. Sanders

Research output: Contribution to conferencePaper

Abstract

Distributed checkpointing is an important concept in providing fault tolerance in distributed systems. In today's applications, e.g., grid and massively parallel applications, the imposed overhead of taking a distributed checkpoint using the known approaches can often outweigh its benefits due to coordination and other overhead from the processes. This paper presents an innovative approach for distributed checkpointing. In this approach, the checkpoints are obtained using offline analysis based on the application level. During execution, no coordination is required. After presenting our approach, we prove its safety and present a performance analysis of it using stochastic models.

Original languageEnglish (US)
Pages177-186
Number of pages10
StatePublished - Jan 1 2005
Event25th IEEE International Conference on Distributed Computing Systems - Columbus, OH, United States
Duration: Jun 6 2005Jun 10 2005

Other

Other25th IEEE International Conference on Distributed Computing Systems
CountryUnited States
CityColumbus, OH
Period6/6/056/10/05

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Application-driven coordination-free distributed checkpointing'. Together they form a unique fingerprint.

  • Cite this

    Agbaria, A., & Sanders, W. H. (2005). Application-driven coordination-free distributed checkpointing. 177-186. Paper presented at 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States.