Efficient Incremental Checkpointing of Java Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

Efficient Incremental Checkpointing of Java Programs


This paper presents a user-driven language-level approach to the checkpointing of Java programs. First, we describe how to systematically associate increment- al checkpoints with Java classes. While being safe, the genericity of this solution induces a substantial execution overhead. Second, to solve the dilemma between genericity and performance, we use automatic program specialization to transform the generic checkpointing procedures into highly optimized ones. Specialization exploits two kinds of information: (i) structural properties about the program classes, (ii) knowledge of unmodified data structures in a specific program phase. The latter information allows us to generate phase-specific checkpointing procedures. We evaluate our approach on two benchmarks, a realistic application which consists of a program analysis engine, and a synthetic program which can serve as a metric. Specialization gives a speedup proportional to the complexity of object structure and the modification pattern. Measured speedups are up to 15.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3810.pdf (302.04 Ko) Télécharger le fichier

Dates and versions

inria-00072848 , version 1 (24-05-2006)


  • HAL Id : inria-00072848 , version 1


Julia L. Lawall, Gilles Muller. Efficient Incremental Checkpointing of Java Programs. [Research Report] RR-3810, INRIA. 1999. ⟨inria-00072848⟩
66 View
194 Download


Gmail Facebook Twitter LinkedIn More