Implementing Garbage Collection in the PerDiS system - Archive ouverte HAL Access content directly
Conference Papers Year : 1998

Implementing Garbage Collection in the PerDiS system

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

Abstract

We describe the PerDiS persistent distributed store and its garbage collection algorithm. The PerDiS store behaves like an object-oriented persistent shared memory, and is accessed transactionally. Applications get direct access to persistent data in their own memory, and use the usual C/C++ pointer dereferencing and assignment to navigate and modify the object graph. PerDiS provides persistence by reachability based on the Larchant algorithm. We focus on the issues of implementation for large-scale sharing. The main problems we face involve concurrency, ordering and consistency. We also address performance/modularity trade-offs
Fichier principal
Vignette du fichier
IGCPS_pos8.pdf (253.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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

Identifiers

  • HAL Id : inria-00444641 , version 1

Cite

Xavier Blondel, Paulo Ferreira, Marc Shapiro. Implementing Garbage Collection in the PerDiS system. Proceedings of the Eighth International Workshop on Persistent Object Systems, 1998, Tiburon CA, USA, United States. ⟨inria-00444641⟩

Collections

INRIA INRIA2
61 View
73 Download

Share

Gmail Facebook Twitter LinkedIn More