By Topic

Implementing orthogonal persistence: a simple optimization using replicating collection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nettles, S. ; Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA ; O'Toole, J.

Orthogonal persistence provides a safe and convenient model of object persistence. We have implemented a transaction system which 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 nonpersistent objects can add to the cost of this operation. We show how to eliminate these additional costs by using replicating garbage collection. The resulting implementation of orthogonal persistence should provide transaction performance that is independent of the quantity of nonpersistent data in use. We expect efficient support for orthogonal persistence to be valuable in operating systems applications which use persistent data

Published in:

Object Orientation in Operating Systems, 1993., Proceedings of the Third International Workshop on

Date of Conference:

9-10 Dec 1993