Newsgroups: alt.lang.design,comp.lang.c,comp.lang.c++,comp.lang.lisp,comp.lang.ada
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!ix.netcom.com!netcom.com!hbaker
From: hbaker@netcom.com (Henry G. Baker)
Subject: Re: Reference Counting (was Re: Searching Method for Incremental Garbage Collection)
Message-ID: <hbakerD07221.1C0@netcom.com>
Organization: nil
References: <D06r8x.JBy@inmet.camb.inmet.com>
Date: Fri, 2 Dec 1994 17:32:25 GMT
Lines: 14
Xref: glinda.oz.cs.cmu.edu comp.lang.c:118953 comp.lang.c++:101358 comp.lang.lisp:15903 comp.lang.ada:24299

In article <D06r8x.JBy@inmet.camb.inmet.com> mg@asp.camb.inmet.com (Mitch Gart) writes:
>then RC sounds like a reasonable memory reclamation scheme for Ada.

You should be prepared for huge overheads when updating reference
counts on shared objects in a multiple-threaded (multiple-tasked)
program.  (Not that GC in such an environment is all that easy, but RC
is no panacea either.)

Henry Baker
Read (192.100.81.1) ftp.netcom.com:/pub/hb/hbaker/README for ftp-able papers.
WWW archive: ftp://ftp.netcom.com/pub/hb/hbaker/home.html
************* Note change of address ^^^        ^^^^


