On Wed, 30 Aug 2000, Joshua N Pritikin wrote:
> On Wed, Aug 30, 2000 at 01:15:39PM -0400, [EMAIL PROTECTED] wrote:
> > I didn't realize until I read through parts of this exactly how much time a
> > refcounting GC scheme took. Between that and perl 5's penchant for
> > flattening arrays and has
On Wed, Aug 30, 2000 at 01:15:39PM -0400, [EMAIL PROTECTED] wrote:
> I didn't realize until I read through parts of this exactly how much time a
> refcounting GC scheme took. Between that and perl 5's penchant for
> flattening arrays and hashes (which creates a lot of garbage itself for
> biggi
At 11:10 AM 8/30/00 -0500, Jarkko Hietaniemi wrote:
>Something for the reference shelf:
>
> Garbage Collection
> Algorithms for Automatic Dynamic Memory Management
> Richard Jones & Raphael Lins
> John Wiley and Sons, 1996
> ISBN-0-471-94148-4
>
>Still haven
On Wed, Aug 30, 2000 at 12:19:35PM -0400, Uri Guttman wrote:
> > "JH" == Jarkko Hietaniemi <[EMAIL PROTECTED]> writes:
>
> JH> Introduction
> JH> The Classical Algorithms (refcounting, mark-and-sweep, copying)
> JH> Reference Counting (several variants)
> JH>
> "JH" == Jarkko Hietaniemi <[EMAIL PROTECTED]> writes:
JH> Introduction
JH> The Classical Algorithms (refcounting, mark-and-sweep, copying)
JH> Reference Counting (several variants)
JH> Mark-Sweep (ditto)
JH> Mark-Compact (ditto)
JH> Copying (various strategies)
JH>
Something for the reference shelf:
Garbage Collection
Algorithms for Automatic Dynamic Memory Management
Richard Jones & Raphael Lins
John Wiley and Sons, 1996
ISBN-0-471-94148-4
Still haven't had time to delve into it but from a quick browse it looks
real
