Xref: utzoo comp.lang.lisp:2675 comp.lang.misc:3934 comp.lang.smalltalk:1639
Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!usc!apple!agate!shelby!neon!carcoar!wilson
From: wilson@carcoar.Stanford.EDU (Paul Wilson)
Newsgroups: comp.lang.lisp,comp.lang.misc,comp.lang.smalltalk
Subject: Re: Garbage collection algorithms
Summary: correction: Joel Bartlett does "mostly copying" gc
Message-ID: <1990Jan23.030641.21113@Neon.Stanford.EDU>
Date: 23 Jan 90 03:06:41 GMT
References: <366@argosy.UUCP> <1990Jan22.111348.5585@Neon.Stanford.EDU>
Sender: news@Neon.Stanford.EDU (USENET News System)
Reply-To: wilson@carcoar.Stanford.EDU (Paul Wilson)
Organization: U. of Illinois at Chicago (UIC, *not* UofC or UIUC)
Lines: 21

In article <1990Jan22.111348.5585@Neon.Stanford.EDU> wilson@carcoar.Stanford.EDU I (Paul Wilson) write:
>
>  Lately several groups have been working on conservative mark-sweep
>  gc's that can deal with the kind of pointer ambiguities you get
>  in languages like C.  They even have generational versions.  People
>  doing this include Hans Boehm at Rice, the Portable Common Runtime
>  group at Xerox PARC, and Joel Bartlett at DEC WRL.  (You're
                        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nope.  I was wrong.  He does "mostly copying garbage collection," and
his tech report on it is next on my reading list.  But his system does
deal with ambiguous pointers, and has recently become generational.

>Paul R. Wilson                         
>Software Systems Laboratory               lab ph.: (312) 996-9216
>U. of Illin. at C. EECS Dept. (M/C 154)   wilson@carcoar.stanford.edu
>Box 4348   Chicago,IL 60680 

Paul R. Wilson                         
Software Systems Laboratory               lab ph.: (312) 996-9216
U. of Illin. at C. EECS Dept. (M/C 154)   wilson@carcoar.stanford.edu
Box 4348   Chicago,IL 60680