Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!wuarchive!uunet!world!iecc!compilers-sender From: moss@cs.umass.edu (Eliot Moss) Newsgroups: comp.compilers Subject: Re: Intros to scavenging GC Keywords: storage. C++ Message-ID: Date: 30 Apr 91 12:39:07 GMT References: <1991Apr29.231751.4028@sbctri.sbc.com> Sender: compilers-sender@iecc.cambridge.ma.us Reply-To: moss@cs.umass.edu (Eliot Moss) Organization: Dept of Comp and Info Sci, Univ of Mass (Amherst) Lines: 20 Approved: compilers@iecc.cambridge.ma.us Dan Edelson's thesis does not discuss scavenging style GC, though it is a copying scheme if I recall correctly. The original scavenging article was by David Ungar in the Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments. The Wilson and Moher article in OOPSLA 89, which gives a lot of background on gc techniques. Note that in order to do scavenging you have to do store checks and manage remembered sets, which incurs overhead on every pointers store (at least stores of pointers to instances of the classes you scavenge). Note also that we are working on quality compiler support for scavenging in the GNU Modula-3 effort of my research group at UMass. -- J. Eliot B. Moss, Assistant Professor Department of Computer and Information Science Lederle Graduate Research Center University of Massachusetts Amherst, MA 01003 (413) 545-4206, 545-1249 (fax); Moss@cs.umass.edu -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.