Incremental Mature Garbage Collection Using the Train Algorithm - Abstract

Jacob Seligmann & Steffen Grarup
Computer Science Department, Aarhus University
Ny Munkegade 116, DK-8000 Århus C, Denmark
E-mail: {jacobse,grarup}@cs.au.dk

Proceedings of ECOOP'95, Ninth European Conference on Object-Oriented Programming, Lecture Notes in Computer Science, Vol. 952, pp. 235-252, Springer Verlag, 1995. ISBN 3-540-60160-0.

Abstract

We present an implementation of the Train Algorithm, an incremental collection scheme for reclamation of mature garbage in generation-based memory management systems. To the best of our knowledge, this is the first Train Algorithm implementation ever. Using the algorithm, the traditional mark-sweep garbage collector employed by the Mjølner run-time system for the object-oriented BETA programming language was replaced by a non-disruptive one, with only negligible time and storage overheads.

Click here to retrieve the whole paper in HTML (70Kb) or PostScript (200Kb) form.
Click here to retrieve the ECOOP presentation slides in PowerPoint (40Kb) or PostScript (500Kb) form.