Related articles |
---|
Garbage Collection to IMPROVE speed mark@premenos.sf.ca.us (1992-06-17) |
Re: Garbage Collection to IMPROVE speed hays@ssd.intel.com (1992-06-17) |
Re: Garbage Collection to IMPROVE speed barmar@think.com (1992-06-18) |
Garbage Collection to IMPROVE speed gadbois@MCC.COM (1992-06-18) |
Re: Garbage Collection to IMPROVE speed hosking@cs.umass.edu (1992-06-19) |
Newsgroups: | comp.compilers |
From: | hays@ssd.intel.com (Kirk Hays) |
Keywords: | storage, bibliography |
Organization: | Intel Supercomputer Systems Division |
References: | 92-06-067 |
Date: | Wed, 17 Jun 1992 23:38:34 GMT |
mark@premenos.sf.ca.us (Mark Grand) writes:
|> Today I attended a talk given by Andrew Appel on garbage collection where
|> he suggested that use of a garbage collector could make a program faster
|> by arranging data in such a way as to improve locality of reference. ...
Some of the papers I've seen on generational garbage collecting address
this aspect - unfortunately, I've just moved my office, and my library is
a mess.
You might try:
Stamos, J. W. "Static grouping of small objects to enhance performance of
a paged virtual memory" _ACM Trans. Comput. Syst. 2,3 (May 1984), 155-180
Stamos, J.W. ""A large object-oriented virtual memory: Grouping,
measurements, and performance." Tech. Rep. SCG-82-2, Xerox, PARC, Palo
Alto, CA, May 1982
Zorn, B.G. "Comparative performance evaluation of garbage collection
algorithms." Ph.D. dissertation, Tech. Rep. UCB/CSD 89/544, Univ. of
Calif. at Berkeley, Mar. 1989
--
Kirk Hays
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.