We describe how reachability-based orthogonal persistence can be supported even in uncooperative implementations of languages such as C++ and Modula-3, and without modification to the compiler. Our scheme extends Bartlett’s mostly-copying garbage collector to manage both transient objects and resident persistent objects, and to compute the reachability closure necessary for stabilization of the persistent heap. It has been implemented in our prototype of reachability-based persistence for Modula-3, yielding performance competitive with that of comparable, but non-orthogonal, persistent variants of C++. Experimental results, using the OO7 object database benchmarks, reveal that the mostly-copying approach offers a straightforward path to efficient orthogonal persistence in these uncooperative environments. The results also characterize the performance of persistence implementations based on virtual memory protection primitives.
@inproceedings{Hosking+1999OOPSLA,
author = {Hosking, Antony L. and Chen, Jiawan},
title = {Mostly-Copying Reachability-Based Orthogonal Persistence},
booktitle = {ACM SIGPLAN Conference on Object-Oriented Programming,
Systems, Languages, and Applications},
series = {OOPSLA},
year = {1999},
pages = {383--398},
month = {November},
address = {Denver, Colorado},
doi = {10.1145/320384.320427},
acm = {http://dl.acm.org/authorize?N93670},
gscholar = {16}
}