On Mon, 5 Feb 2001, Paul Makepeace wrote:
> On Mon, Feb 05, 2001 at 10:42:08PM +0000, Shevek wrote:
> > I later prove that it is possible to do a hard real time reference
> > counting garbage collector,
>
> I've heard of implementations of hard real time GCs but they're
> ultra-slow. Can you prove one comparably as fast as a non-real
> time one is possible? Constant factors are killers :-)
>
> Paul
Oh yes :-) But allocation is N time for a block size N, and memory
overhead is one pointer per block. I implemented it for cons cells, it was
beautiful, but one pointer per cons is a lot. However, it was hard real
time.
S.
--
Shevek
I am the Borg.
sub AUTOLOAD { ($s=$AUTOLOAD)=~s/.*:://; eval qq{ *$AUTOLOAD=$s
?sub {$s*&{$s-1}} :sub {1}; }; goto &$AUTOLOAD; } print &{'4'};
