Re: Static Garbage Collection

"Armel" <armelasselin@hotmail.com>
Fri, 29 May 2009 11:20:04 +0200

          From comp.compilers

Related articles
[3 earlier articles]
Re: Static Garbage Collection torbenm@pc-003.diku.dk (2009-05-26)
Re: Static Garbage Collection mailbox@dmitry-kazakov.de (Dmitry A. Kazakov) (2009-05-26)
Re: Static Garbage Collection stock@esa.informatik.tu-darmstadt.de (Florian Stock) (2009-05-26)
Re: Static Garbage Collection ott@mirix.org (Matthias-Christian Ott) (2009-05-26)
Re: Static Garbage Collection vincent@famillebelliard.fr (Vincent Belliard) (2009-05-26)
Re: Static Garbage Collection DrDiettrich1@aol.com (Hans-Peter Diettrich) (2009-05-29)
Re: Static Garbage Collection armelasselin@hotmail.com (Armel) (2009-05-29)
Re: Static Garbage Collection marcov@stack.nl (Marco van de Voort) (2009-05-30)
Re: Static Garbage Collection vincent@famillebelliard.fr (Vincent Belliard) (2009-05-31)
Re: Static Garbage Collection armelasselin@hotmail.com (Armel) (2009-06-01)
| List of all articles for this month |
From: "Armel" <armelasselin@hotmail.com>
Newsgroups: comp.compilers
Date: Fri, 29 May 2009 11:20:04 +0200
Organization: les newsgroups par Orange
References: 09-05-120 09-05-130
Keywords: GC, parallel
Posted-Date: 31 May 2009 11:43:59 EDT

"Vincent Belliard" <vincent@famillebelliard.fr> a icrit
> If you have a tree structure for your objects, it's obvious : you just
> have to count reference on objects and then delete objects when the count
> reach 0.
>
> If you have a graph structure, it's quite difficult. If you have a loop
> with your objects, you won't be able to delete it even if it's not
> referenced anymore.


note that garbage collection in multi-threaded application was proven to be
possible using reference counts, even for cyclic graphs.
there is paper called "Concurrent Cycle Collection in Reference Counted
Systems", June 2001, from David F. Bacon and V.T. Rajan


Regards
Armel



Post a followup to this message

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