James S. Plank, Jian Xu and Rob Netzer
Technical Report CS-95-302, University of Tennessee, August, 1995.
This paper was never published in a conference or journal -- pity, because it's a pretty good paper...
Available via anonymous ftp to cs.utk.edu in pub/plank/papers/CS-95-302.ps and pub/plank/papers/CS-95-302.pdf.
We describe two checkpointing algorithms based on compressed differences, called standard and online compressed differences. These algorithms are analyzed in detail to determine the conditions that are necessary for them to improve the performance of checkpointing. We then present results of implementing these algorithms in a uniprocessor checkpointing system. These results both corroborate the analysis and show that in this environment, standard compressed differences almost invariably improve the performance of both sequential and incremental checkpointing.
author J. S. Plank and J. Xu and R. H. B. Netzer title Compressed Differences: An Algorithm for Fast Incremental Checkpointing institution University of Tennessee number CS-95-302 month August year 1995 where http://web.eecs.utk.edu/~jplank/plank/papers/CS-95-302.html
@TECHREPORT{pxn:95:scd, author = "J. S. Plank and J. Xu and R. H. B. Netzer", title = "Compressed Differences: An Algorithm for Fast Incremental Checkpointing", institution = "University of Tennessee", number = "CS-95-302", month = "August", year = "1995", where = "http://web.eecs.utk.edu/~jplank/plank/papers/CS-95-302.html" }