Efficient Incremental Checkpointing of Java Programs
Saved in:
| Title: | Efficient Incremental Checkpointing of Java Programs |
|---|---|
| Authors: | Lawall, Julia Laetitia, Muller, Gilles |
| Source: | Lawall , J L & Muller , G 2000 , Efficient Incremental Checkpointing of Java Programs . in International Conference on Dependable Systems and Networks (DSN 2000) . IEEE Computer Society Press , pp. 61-70 , International Conference on Dependable Systems and Networks , New York, NY , United States , 25/06/2000 . https://doi.org/10.1109/ICDSN.2000.857515 |
| Publisher Information: | IEEE Computer Society Press |
| Publication Year: | 2000 |
| Collection: | University of Copenhagen: Research / Forskning ved Københavns Universitet |
| Description: | 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. |
| Document Type: | article in journal/newspaper |
| Language: | English |
| DOI: | 10.1109/ICDSN.2000.857515 |
| Availability: | https://researchprofiles.ku.dk/da/publications/2c70dbc0-bb5d-11de-bda0-000ea68e967b https://doi.org/10.1109/ICDSN.2000.857515 |
| Rights: | info:eu-repo/semantics/restrictedAccess |
| Accession Number: | edsbas.F0733E5F |
| Database: | BASE |
Nájsť tento článok vo Web of Science | 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. |
|---|---|
| DOI: | 10.1109/ICDSN.2000.857515 |