ACM Home Page
Please provide us with feedback. Feedback
An adaptive tenuring policy for generation scavengers
Full text PdfPdf (1.74 MB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 14 ,  Issue 1  (January 1992) table of contents
Pages: 1 - 27  
Year of Publication: 1992
ISSN:0164-0925
Authors
David Ungar  Sun Microsystems
Frank Jackson  ParcPlace Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 40,   Citation Count: 27
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/111186.116734
What is a DOI?

ABSTRACT

One of the more promising automatic storage reclamation techniques, generation scavenging, 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 a two-generation scavenger using traces taken from actual 4-h sessions. There was a wide variation in the sample runs, with garbage-collection overhead ranging from insignificant, during three of the runs, to severe, during a single run. All runs demonstrated that performance could be improved with two techniques: segregating large bitmaps and strings, and adapting the scavenger's tenuring policy according to demographic feedback. We therefore incorporated these ideas into a commercial Smalltalk implementation. These two improvements deserve consideration for any storage reclamation strategy that utilizes a generation scavenger.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BAKER, H. G. List processing in real time on a serial computer. A i Working Paper 139, MIT-AI Lab., Boston, Mass., Apr. 1977.
 
2
BECK, K. Private communication, Mar. 1988.
3
4
 
5
BOSWORTH, G. Private communication, Mar. 1988.
 
6
BROWNBmD6E, D R. Recursive structures in computer systems Ph D dissertation, University of Newcastle upon Tyne, Sept. 1984.
 
7
CAUDmL, P. J., AND Wn~Fs-BRocK, A. A third generation Smalltalk-80 implementatlon. ACM SIGPLAN Not~ces 21, 11 (Nov. 86).
 
8
DEUTSCH, L.P. The Dorado Smalltalk-80 implementation: Hardware architecture's impact on software architecture. In G. Krasner, Ed., Smalltalk~80 Bits ofHistory, Words of Advice, Addison-Wesley, Reading, Mass., 1983, pp. 113-126.
9
10
 
11
FATEMAN, R.J. Private communication, 1983.
12
 
13
 
14
KAE~LER, T., AND KRASNER, G. LOOM Large object-oriented memory for Smalltalk-80 systems. In Smalltalk-80: Bits of Histor~, Words of Advice, G. Krasner, Ed., Addison-Welsey, Reading, Mass., 1983, pp. 251-271.
 
15
LEE, E. Object storage and inheritance for SELF, a prototype-based object-oriented programming language. Engineer's thesis, Stanford Univerity, Stanford, Calif., Dec. 1988.
16
17
18
 
19
SHAW, R. A. Empirical analysis of a Lisp system. Tech. Rep. CSL~TR-88-351, Stanford University, Stanford, Calif., Feb. 1988.
 
20
STAMOS, J. W. A large object-oriented virtual memory: Grouping, measurements, and performance. Tech. Rep. SCG-82-2, Xerox, PARC, Palo Alto, Calif., May 1982.
21
 
22
23
 
24
25
26
27
 
28

CITED BY  27


REVIEW

"R. Nigel Horspool : Reviewer"

In systems with automatic garbage collection, most garbage is relatively short-lived. An effective approach for reducing garbage collection costs is to perform frequent, relatively cheap collections on recently allocated storage objects, and t  more...

Collaborative Colleagues:
David Ungar: colleagues
Frank Jackson: colleagues