Garbage Collection of Persistent Objects in Distributed Shared Memory

Paulo Ferreira 1 Marc Shapiro 1
1 SOR - Distributed Object Systems
Inria Paris-Rocquencourt
Abstract : This paper describes a garbage collection algorithm for distributed persistent objects in a loosely coupled network of workstations. Objects are accessed via a weakly consistent shared distributed virtual memory with recoverable properties. We address the specific problem of garbage collecting a large amount of distributed persistent objects, cached on several nodes for efficient sharing. For clustering purposes, objects are allocated within segments, and segments are logically grouped into bunches . The garbage collection subsystem combines three sub-algorithms: the bunches garbage collector that cleans one bunch (possibly multiply-cached) independently of any other, the scion cleaner that propagates accessibility information across bunches, and the group collector aimed at reclaiming inter-bunch cycles of dead objects. These three sub-algorithms are highly independent. Thus, the garbage collection subsystem has a high degree of scalability and parallelism. On top of this, it reclaims cycles of garbage, it does not require any particular communication support such as causality or atomicity, and is well suited to large scale networks.
Keywords : gc rep sor
Complete list of metadatas

https://hal.inria.fr/inria-00444630
Contributor : Marc Shapiro <>
Submitted on : Thursday, January 7, 2010 - 9:42:38 AM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on : Thursday, June 17, 2010 - 10:25:37 PM

File

GC-PERS-DSM_POS94.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00444630, version 1

Collections

Citation

Paulo Ferreira, Marc Shapiro. Garbage Collection of Persistent Objects in Distributed Shared Memory. pos, 1994, Tarascon, France, France. pp.176--191. ⟨inria-00444630⟩

Share

Metrics

Record views

302

Files downloads

158