Tenuring policies for generation-based storage reclamation
Authors:
Open Access
- 1 January 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 23 (11) , 1-17
Abstract
One of the most promising automatic storage reclamation techniques, generation-based storage reclamation, suffers poor performance if many objects live for a fairly long time and then die. We have investigated the severity of this problem by simulating Generation Scavenging automatic storage reclamation from traces of actual four-hour sessions. There was a wide variation in the sample runs, with garbage-collection overhead ranging from insignificant, during the interactive runs, to severe, during a single non-interactive run. All runs demonstrated that performance could be improved with two techniques: segregating large bitmaps and strings, and mediating tenuring with demographic feedback. These two improvements deserve consideration for any generation-based storage reclamation strategy.Keywords
This publication has 9 references indexed in Scilit:
- A third generation Smalltalk-80 implementation1986
- Static grouping of small objects to enhance performance of a paged virtual memoryACM Transactions on Computer Systems, 1984
- Efficient implementation of the smalltalk-80 system1984
- Generation Scavenging1984
- A real-time garbage collector based on the lifetimes of objectsCommunications of the ACM, 1983
- Characterization of VAX Macsyma1981
- An efficient, incremental, automatic garbage collectorCommunications of the ACM, 1976
- A method for overlapping and erasure of listsCommunications of the ACM, 1960
- Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 1960