Modelling a Distributed Cached Store for Garbage Collection: the algorithm and its correctness proof - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

Modelling a Distributed Cached Store for Garbage Collection: the algorithm and its correctness proof

Paulo Ferreira
Marc Shapiro

Abstract

Caching and persistence support efficient, convenient and transparent distributed data sharing. The most natural model of persistence is persistence by reachability, managed automatically by a garbage collector (GC). We propose a very general model of such a system (based on distributed shared memory) and a scalable, asynchronous distributed GC algorithm. Within this model, we show sufficient and widely applicable correctness conditions for the interactions between applications, store, memory, coherence, and GC. The GC runs as a set of processes (local to each participating machine) communicating by asynchronous messages. Collection does not interfere with applications by setting locks, polluting caches, or causing I/O; this requirement raised some novel and interesting challenges which we address in this article. The algorithm is safe and live; it is not complete, i.e. it collects some distributed cycles of garbage but not necessarily all.

Keywords

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

Dates and versions

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

Identifiers

Cite

Paulo Ferreira, Marc Shapiro. Modelling a Distributed Cached Store for Garbage Collection: the algorithm and its correctness proof. Euro. Conf. on Object-Oriented Pging. (ECOOP), 1998, Brussels, Belgium. pp.234--259, ⟨10.1007/BFb0054094⟩. ⟨hal-01248219⟩

Collections

INRIA INRIA2
245 View
129 Download

Altmetric

Share

Gmail Facebook X LinkedIn More