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't had time to delve into it but from a quick browse it looks
>really good and my heavily-into-LISP-boss recommends it.
Got it, and I'm about halfway through. (Along with a half-dozen other
books...) It makes a lot of sense so far, and if the non-pausing GC stuff
(that I haven't gotten to) in the back half of the book pans out for perl,
we may get a good performance win just from that.
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
biggish things), I wonder how much perl 5's performance could be boosted
with some relatively minor changes to GC & list handling.
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
