[gclist] DSM and GC
Mon, 10 Aug 1998 06:47:45 -0700 (PDT)
---Xavier Blondel <Xavier.Blondel@inria.fr> wrote:
> >Hi everybody,
> >I'm working on a project at my university, and
> >therefore have to implement a distributed garbage
> >collection algorithm that collects objects in a
> >shared memory environment.
> >Ideally it should have the following prperties:
> As should any DGC have ;-)
> >I couldn't find anything appropriate online so far.
> >Any tips, ideas, references ?
> You can have a look at Larchant:
Done, but seems completely unefficient.
"While theoretically complete, this strategy is
extremely inefficient. [...] We plan to implement
only the locality based heuristic..."
> and at PerDiS:
> more precisely:
uses the same GC-algoritm as Larchant
> And if you get bored with INRIA-SOR stuff ;-), you
can still have a look at:
> There must be something about DGC in the FAQ (even
though I did not manage
> to retrieve it...)
This was one of the first docs I read, but it does
not really explore distributed GC with replicated
only says reference counting / listing.
Doesn't reference counting/listing involve keeping a
Because a reference can be destroyed on a different
computer than it was created, therefore leaving the
local counts in an inconsistent state.
How do I collect replicas of the object?
DO YOU YAHOO!?
Get your free @yahoo.com address at http://mail.yahoo.com