Newsgroups: comp.lang.misc,comp.lang.scheme,comp.programming,alt.lang.design
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news3.near.net!noc.near.net!paperboy.wellfleet.com!news-feed-1.peachnet.edu!gatech!newsfeed.pitt.edu!uunet!olivea!charnel.ecst.csuchico.edu!csusac!csus.edu!netcom.com!thinman
From: thinman@netcom.com (Technically Sweet)
Subject: Re: Generational GC
Message-ID: <thinmanD5v5KE.1zu@netcom.com>
Organization: International Foundation for Internal Freedom
References: <D5q2M1.A3H@emi.net>
Date: Wed, 22 Mar 1995 22:38:38 GMT
Lines: 15
Sender: thinman@netcom21.netcom.com
Xref: glinda.oz.cs.cmu.edu comp.lang.misc:21023 comp.lang.scheme:12390 comp.programming:15637


markg@athens.emi.net (Mark Grosberg) writes:

>Does anybody have any code or can explain how generational GC works and 
>how efficient are the various methods of GC. For virtual machines, not 
>actual assembly/C code.

ftp.cs.utexas.edu:/pub/garbage is the place.  A survey of GC,
generation GC, distributed GC, all kinds of stuff.

-- 

Lance Norskog
thinman@netcom.com
Artisputtingtogether. Art  s th ow n  aw y.
