Best Ref-counting algorithms?

=?ISO-8859-1?Q?Christoffer_Lern=F6?= <lerno@dragonascendant.com>
Sun, 12 Jul 2009 13:41:59 -0700 (PDT)

          From comp.compilers
Related articles
Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-12)
Re: Best Ref-counting algorithms? haberg_20080406@math.su.se (Hans Aberg) (2009-07-13)
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-13)
Re: Best Ref-counting algorithms? cr88192@hotmail.com (BGB / cr88192) (2009-07-13)
Re: Best Ref-counting algorithms? torbenm@pc-003.diku.dk (2009-07-14)
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-14)
Re: Best Ref-counting algorithms? haberg_20080406@math.su.se (Hans Aberg) (2009-07-14)
[33 later articles]
| List of all articles for this month |
From: =?ISO-8859-1?Q?Christoffer_Lern=F6?= <lerno@dragonascendant.com>
Newsgroups: comp.compilers
Date: Sun, 12 Jul 2009 13:41:59 -0700 (PDT)
Organization: Compilers Central
Keywords: GC, question
Posted-Date: 13 Jul 2009 06:53:53 EDT

Hi


I'm looking into GC using ref-counting.


Does anyone know what passes for state-of-the-art when it comes to ref-
counting algorithms?
I've read papers by Lins 2003 "Lazy Cyclic Reference Counting",
Bacon / Rajan 2001 "Concurrent Cycle Collection in Reference Counted
Systems" and a few others.


If one would like to implement a fast GC using refcounting, should I
implement something like in those papers, or are there better
algorithms out there?


/Christoffer


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.