Actions for Performance Analysis of Garbage Collection and Dynamic Reordering in a Lisp System

Email RIS file
Bookmark
Report an Issue

Performance Analysis of Garbage Collection and Dynamic Reordering in a Lisp System

Author
Llames, Rene Lim
Published
May 1, 1991.
Physical Description
1 electronic document
Online Version

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access
Summary
Generation based garbage collection and dynamic reordering of objects are two techniques for improving the efficiency of memory management in Lisp and similar dynamic language systems. An analysis of the effect of generation configuration is presented, focusing on the effect of a number of generations and generation capabilities. Analytic timing and survival models are used to represent garbage collection runtime and to derive structural results on its behavior. The survival model provides bounds on the age of objects surviving a garbage collection at a particular level. Empirical results show that execution time is most sensitive to the capacity of the youngest generation. A technique called scanning for transport statistics, for evaluating the effectiveness of reordering independent of main memory size, is presented.
Other Subject(s)
Collection
NASA Technical Reports Server (NTRS) Collection.
Note
Document ID: 19910014425.
Accession ID: 91N23738.
CRHC-91-20.
NAS 1.26:188205.
UILU-ENG-91-2230.
NASA-CR-188205.
Terms of Use and Reproduction
No Copyright.
View MARC record | catkey: 15681046