The Community for Technology Leaders
Proceeding International Conference on Dependable Systems and Networks. DSN 2000 (2000)
New York, New York
June 25, 2000 to June 28, 2000
ISBN: 0-7695-0707-7
pp: 61
ABSTRACT
This paper investigates the optimization of language-level checkpointing of Java programs. First, we describe how to systematically associate incremental checkpoints with Java classes. While being safe, the genericness of this solution induces substantial execution overhead. Second, to solve the dilemma of genericness versus performance, we use automatic program specialization to transform the generic checkpointing methods into highly optimized ones. Specialization exploits two kinds of information: (i) structural properties about the program classes, (ii) knowledge of unmodified data structures in specific program phases. The latter information allows us to generate phase-specific checkpointing methods. 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 the object structure and the modification pattern. Measured speedups for the program analysis engine are up to 1.5, and for the synthetic program are up to 15.
INDEX TERMS
incremental checkpointing, Java, program specialization
CITATION

G. Muller and J. L. Lawall, "Efficient Incremental Checkpointing of Java Programs," Proceeding International Conference on Dependable Systems and Networks. DSN 2000(DSN), New York, New York, 2000, pp. 61.
doi:10.1109/ICDSN.2000.857515
94 ms
(Ver 3.3 (11022016))