Related articles |
---|
Large-space GC pardo@cs.washington.edu (1992-08-20) |
Re: Large-space GC hisgen@src.dec.com (1992-08-20) |
Re: Large-space GC kandt@ai-titania.Jpl.Nasa.Gov (1992-08-21) |
Re: Large-space GC moss@cs.umass.edu (1992-08-24) |
Re: Large-space GC pardo@cs.washington.edu (1992-08-27) |
Newsgroups: | comp.compilers |
From: | hisgen@src.dec.com (Andy Hisgen) |
Organization: | Compilers Central |
Date: | Thu, 20 Aug 1992 22:07:18 GMT |
Keywords: | GC, storage, design |
References: | 92-08-117 |
In the 70's, someone at MIT, I believe Peter Bishop, did a PhD
dissertation on Garbage Collection in Very Large Address Spaces. My
recollection is a little hazy, but persistent and long-lived storage was a
major issue. I believe his work is closest to your suggestion of "Keep
summary info for a segment, where the summary info says what other
segments have pointers in to the segment and what other segments are
pointed to by the segment." (But don't take my word for it).
Andy Hisgen
hisgen@src.dec.com
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.