Forskning ved Københavns Universitet - Københavns Universitet

Forside

Efficient Incremental Checkpointing of Java Programs

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

  • Julia Laetitia Lawall
  • Gilles Muller
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.
OriginalsprogEngelsk
TitelInternational Conference on Dependable Systems and Networks (DSN 2000)
ForlagIEEE Computer Society Press
Publikationsdato2000
Sider61-70
ISBN (Trykt)0-7695-0707-7
DOI
StatusUdgivet - 2000
BegivenhedInternational Conference on Dependable Systems and Networks - New York, NY, USA
Varighed: 25 jun. 200028 jun. 2000

Konference

KonferenceInternational Conference on Dependable Systems and Networks
LandUSA
ByNew York, NY
Periode25/06/200028/06/2000

ID: 15196504