Scott Nettles and James O'Toole
IEEE International Workshop on Object-Orientation in Operating Systems, Asheville, North Carolina, December 1993

Orthogonal persistence provides a safe and convenient model of object persistence. We have implemented a transaction system that supports orthogonal persistence in a garbage collected heap. In our system, replicating collection provides efficient concurrent garbage collection of the heap. In this paper, we show how replicating garbage collection can also be used to reduce commit operation latencies in our implementation.

We describe how our system implements transaction commit. We explain why the presence of non-persistent data can add to the cost of these operations. We show how to eliminate these additional costs by using replicating garbage collection. The resulting implementation of orthogonal persistent should provide transaction performance that is independent of the quantity of non-persistent data in use. We expect efficient support for orthogonal persistence to be valuable in operating systems applications which use persistent data.

You can download the full text of this paper by selecting the appropriate icon: