home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!dtix!darwin.sura.net!mips!sdd.hp.com!cs.utexas.edu!rutgers!faatcrl!iecc!compilers-sender
- From: hisgen@src.dec.com (Andy Hisgen)
- Newsgroups: comp.compilers
- Subject: Re: Large-space GC
- Keywords: GC, storage, design
- Message-ID: <92-08-127@comp.compilers>
- Date: 20 Aug 92 22:07:18 GMT
- References: <92-08-117@comp.compilers>
- Sender: compilers-sender@iecc.cambridge.ma.us
- Reply-To: hisgen@src.dec.com (Andy Hisgen)
- Organization: Compilers Central
- Lines: 13
- Approved: compilers@iecc.cambridge.ma.us
-
- 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
- --
- Send compilers articles to compilers@iecc.cambridge.ma.us or
- {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
-