Title of article
Mostly-copying reachability-based orthogonal persistence
Author/Authors
Hosking، Antony L. نويسنده , , Chen، Jiawan نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
-381
From page
382
To page
0
Abstract
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 007 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.
Keywords
write barrier , generational and copying collection , Garbage collection , object behavior
Journal title
A C M Sigplan (Programming Languages) Sigplan Notices
Serial Year
1999
Journal title
A C M Sigplan (Programming Languages) Sigplan Notices
Record number
17064
Link To Document