ACM Home Page
Please provide us with feedback. Feedback
Caching considerations for generational garbage collection
Full text PdfPdf (1.09 MB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1992 ACM conference on LISP and functional programming table of contents
San Francisco, California, United States
Pages: 32 - 42  
Year of Publication: 1992
ISBN:0-89791-481-3
Also published in ...
Authors
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 33,   Citation Count: 18
Additional Information:

references   cited by   index terms   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/141471.141500
What is a DOI?

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.

 
App87
 
Ber88
Steven H. Bergstein. Best-case caching in a symbolic multiprocessor. Bachelor's thesis, Massachusetts Institute of Technology EECS Department, Cambridge, Massachusetts, February 1988.
DWH+90
KL91
KLng
 
Lar77
R.G. Larson. Minimizing garbage collection as a function of region size. SIAM Journal on Computing, 6(4):663-667, December 1977.
LH83
MB91
Moo84
 
Nut87
 
PS89
C.-J. Peng and Gurindar S. Sohi. Cache memory design considerations to support languages with dynamic heap allocation. Technical Report 860, Computer Sciences Dept. UniversiW of Wisconsln-Madlson, Madison, Wisconsin, July 1989.
 
Sha88
Ung84
 
Ung86
WLM91
WM89
 
Zor89
Zor90

CITED BY  18

Collaborative Colleagues:
Paul R. Wilson: colleagues
Michael S. Lam: colleagues
Thomas G. Moher: colleagues