BIB-VERSION:: CS-TR-v2.0 ID:: ncstrl.dartmouthcs//TR98-330 ENTRY:: April 30, 1998 ORGANIZATION:: Dartmouth College, Computer Science TITLE:: Straightforward Java Persistence Through Checkpointing TYPE:: Technical Report (paper) REVISION:: 1 AUTHOR:: Howell, Jon DATE:: April 1998 RETRIEVAL:: For a paper copy, email RETRIEVAL:: For a paper copy, write to Technical Report Librarian Department of Computer Science Dartmouth College 6211 Sudikoff Laboratory Hanover, NH 03755-3510 USA RETRIEVAL:: Compressed Postscript at http://www.cs.dartmouth.edu/reports/TR98-330.ps.Z RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR98-330.pdf ABSTRACT:: Several techniques have been proposed for adding persistence to the Java language environment. This paper describes a scheme based on checkpointing the Java Virtual Machine, and compares the scheme to other techniques. Checkpointing offers two unique advantages: first, the implementation is independent of the JVM implementation, and therefore survives JVM updates; second, because checkpointing saves and restores execution state, even threads become persistent entities. NOTE:: Superceded by a conference paper available at http://www.cs.dartmouth.edu/~jonh/research/ END:: ncstrl.dartmouthcs//TR98-330