A detection algorithm for distributed cycles of garbage

Abstract : We present an algorithm that detects cycles of garbage in reference-based distributed systems. It is derived from Hughes' algorithm, in a simplified form that makes far fewer assumptions about the system. A local garbage collector marks incoming and outgoing references with timestamps that are propagated asynchronously between spaces. A central site computes the minimum reachable timestamp, allowing stale references to be identified and deleted. The coexistence of non-participating spaces, and spaces participating in collections controlled by more than one central site, is allowed. Introduction Remote references are often represented by "proxy" objects that transparently implement remote procedure calls. A reference to a remote object points to a stub which has the same interface as the remote object. The stub forwards procedure calls to a corresponding scion (or "server stub") that invokes the procedure directly on the target object. Stubs and scions are well adapted to the support...
Keywords : gc rep
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01248221
Contributor : Alain Monteil <>
Submitted on : Thursday, December 24, 2015 - 9:43:38 AM
Last modification on : Friday, May 25, 2018 - 12:02:06 PM
Document(s) archivé(s) le : Friday, March 25, 2016 - 11:31:43 AM

File

DADCG_gcmm97.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01248221, version 1

Collections

Citation

Fabrice Le Fessant, Ian Piumarta, Marc Shapiro. A detection algorithm for distributed cycles of garbage. OOPSLA W. on Garbage Collection and Memory Management, 1997, Atlanta, GA, United States. ⟨hal-01248221⟩

Share

Metrics

Record views

204

Files downloads

44