Larchant: persistence by reachability in distributed shared memory through garbage collection

Authors:
P. Ferreira;M. Shapiro
Affiliations:
Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France;Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France
Venue:
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Year:
1996

Citing 0
Cited 6

Lessons learned from implementing the CORBA persistent object service

Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Partitioned garbage collection of a large object store

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Garbage collecting the world: one car at a time

Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
The Memory Behavior of the WWW, or The WWW Considered as a Persistent Store

POS-9 Revised Papers from the 9th International Workshop on Persistent Object Systems
Assessing the scalability of garbage collectors on many cores

PLOS '11 Proceedings of the 6th Workshop on Programming Languages and Operating Systems
Assessing the scalability of garbage collectors on many cores

ACM SIGOPS Operating Systems Review

Quantified Score

Hi-index	0.00

Visualization

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.