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.