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

Paulo Ferreira 1 Marc Shapiro 1
1 SOR - Distributed Object Systems
Inria Paris-Rocquencourt
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.
keyword : gc mem sos
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00444639
Contributor : Marc Shapiro <>
Submitted on : Thursday, January 7, 2010 - 9:42:46 AM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on : Friday, June 18, 2010 - 12:27:53 AM

File

LPRDSMGC_icdcs96.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

200

Files downloads

131