TMOS: A Transactional Garbage Collector

Abstract. Defining persistence in terms of reachability is fundamental to achieving orthogonality of persistence. It is implicit to the principles of orthogonal persistence and is a part of the ODMG 3.0 data objects standard. Although space reclamation in the context of persistence by reachability can be achieved automatically using garbage collection, relatively few papers address the problem of implementing garbage collection in a transactional storage system. A transactional GC algorithm must operate correctly in the face of failure, and in particular must deal with the problem of transaction abort, which by undoing changes such as the deletion of references, subverts the GC reachability axiom of `once garbage always garbage'. In this paper we make two key contributions. First, we present a generic approach to the design of transactional collectors that promotes clarity, generality, and understandability, and then using this approach, we present a new transactional garbage coll...

• Type: Conference
• Year: 2000
• Where: POS
• Authors: John N. Zigman, Stephen Blackburn, J. Eliot B. Moss
• Keywords: Garbage Collection, Gc Algorithms, POS 2000, Programming Languages, Transactional Gc