Larchant: Persistence by Reachability in Distributed Shared Memory through Garbage Collection - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1996

Larchant: Persistence by Reachability in Distributed Shared Memory through Garbage Collection

Marc Shapiro

Abstract

We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This DSM+PBR model is based on distributed garbage collection (GC). Within a general model for DSM+PBR, we specify a distributed GC algorithm that is efficient and scalable. Its main features are: (i) independent collection of memory subsets (even when replicated), (ii) orthogonal from coherence, (iii) asynchrony, and (iv) a simple heuristic to collect cycles avoiding extra I/O costs. We briefly describe our implementation and show some performance results.

Keywords

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

Dates and versions

inria-00444639 , version 1 (07-01-2010)

Identifiers

Cite

Paulo Ferreira, Marc Shapiro. Larchant: Persistence by Reachability in Distributed Shared Memory through Garbage Collection. Int. Conf. on Distr. Comp. Sys. (ICDCS), 1996, Hong Kong, Hong Kong SAR China. pp.394--401, ⟨10.1109/ICDCS.1996.507987⟩. ⟨inria-00444639⟩

Collections

INRIA INRIA2
122 View
117 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More