From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,3498dd887729ed19
X-Google-Attributes: gid103376,public
From: Hannes Haug <haugha@informatik.uni-tuebingen.de>
Subject: Re: Garbage Collection in Ada
Date: 1996/10/15
Message-ID: <uvvsp7gzgu3.fsf@chaq.informatik.uni-tuebingen.de>#1/1
X-Deja-AN: 189659553
sender: haugha@chaq.informatik.uni-tuebingen.de
references: <01bbb910$f1e73f60$829d6482@joy.ericsson.se>
organization: Uni Tuebingen
newsgroups: comp.lang.ada
Date: 1996-10-15T00:00:00+00:00
List-Id: <comp.lang.ada>


bobduff@world.std.com (Robert A Duff) writes:

> is certainly true of off-the-shelf general-purpose allocators, but it's
> easy to write an allocator with predictable timing if the objects are
> all of the same size, and that's exactly what some real-time programs
> do.  And some real-time programs avoid using the heap at all, so of
> course GC is just a waste of implementer's time, for *those* programs.

like the off-the-shelf general-purpose allocators

> I know about Henry Baker's papers on real-time GC, but I remain somewhat
> skeptical.  (I suspect most real-time programmers have never heard of
> real-time GC, and would scoff at it.)

I think the commercial grand circle gc is quite similar to baker's
gc for ada. Paul wilson did some work on real-time gc, too.

 -hannes