A detection algorithm for distributed cycles of garbage - Archive ouverte HAL Access content directly
Conference Papers Year : 1997

A detection algorithm for distributed cycles of garbage

(1) , (2) , (2)
1
2
Marc Shapiro

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

Fichier principal
Vignette du fichier
DADCG_gcmm97.pdf (171.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01248221 , version 1 (24-12-2015)

Identifiers

  • HAL Id : hal-01248221 , version 1

Cite

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⟩

Collections

INRIA INRIA2
89 View
36 Download

Share

Gmail Facebook Twitter LinkedIn More