An implementation of complete, asynchronous, distributed garbage collection

Abstract : Most existing reference-based distributed object systems include some kind of acyclic garbage collection, but fail to provide acceptable collection of cyclic garbage. Those that do provide such GC currently suffer from one or more problems: synchronous operation, the need for expensive global consensus or termination algorithms, susceptibility to communication problems, or an algorithm that does not scale. We present a simple, complete, fault-tolerant, asynchronous extension to the (acyclic) cleanup protocol of the SSP Chains system. This extension is scalable, consumes few resources, and could easily be adapted to work in other reference-based distributed object systems---rendering them usable for very large-scale applications.
Keywords : gc rep
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01248220
Contributor : Alain Monteil <>
Submitted on : Thursday, December 24, 2015 - 9:43:36 AM
Last modification on : Friday, May 25, 2018 - 12:02:06 PM

File

ICADGC_pldi98.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Fabrice Le Fessant, Ian Piumarta, Marc Shapiro. An implementation of complete, asynchronous, distributed garbage collection. Conf. on Prog. Lang. Design and Implementation, 1998, Montreal, Canada. ⟨10.1145/277650.277715⟩. ⟨hal-01248220⟩

Share

Metrics

Record views

159

Files downloads

150