MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Garbage Collection for Strongly-Typed Languages using Run-time Type Reconstruction (1994) [33 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Shail Aditya, Shail Aditya, Christine H. Flood, Christine H. Flood, James E. Hicks, James E. Hicks
In ACM Conference on Lisp and Functional Programming
http://www.csg.lcs.mit.edu:8001/Users/shail/papers/gc-lfp94.ps.Z
Add To MetaCart

Abstract:

Garbage collectors perform two functions: live-object detection and dead-object reclamation. In this paper, we present a new technique for live-object detection based on run-time type reconstruction for a strongly-typed, polymorphic language. This scheme uses compile-time type information together with the run-time tree of activation frames to determine the exact type of every object participating in the computation. These reconstructed types are then used to identify and traverse the live heap objects during garbage collection. We describe an implementation of our scheme for the Id parallel programming language compiled for the *T multiprocessor architecture. We present simulation studies that compare the performance of type-reconstructing garbage collection with conservative garbage collection and compilerdirected storage reclamation. 1

Citations

395 Uniprocessor garbage collection techniques (long version). Submitted to ACM Computing Surveys – Wilson - 1994
248 Garbage collection in an uncooperative environment – Boehm, Weiser - 1988
67 Runtime tags aren't necessary – Appel - 1989
64 A Runtime System – Appel - 1990
47 Deciding ML typability is complete for deterministic exponential time – Mairson - 1989
43 A Compiler for the MIT Tagged-Token Dataflow Architecture – Traub - 1986
42 Tag-free garbage collection for strongly typed programming languages – Goldberg - 1991
34 Polymorphic type reconstruction for garbage collection without tags – Goldberg, Gloger - 1992
32 T: Integrated building blocks for parallel computing – Papadopoulos, Boughton, et al. - 1993
21 Compiler-directed Type Reconstruction for Polymorphic Languages – Aditya, Caro - 1993
21 Experiences with compiler-directed storage reclamation – Hicks - 1993
17 A Syntactic Approach to Program Transformations – Ariola, Arvind - 1991
14 Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine – Peyton-Jones - 1992
5 An Incremental Type Inference System for the Programming Language Id – Gupta - 1990
1 Id 90.1 reference manual. CSG Memo 284-2 – Nikhil - 1990