Skip to Main content Skip to Navigation
Conference papers

Implementing Garbage Collection in the PerDiS system

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
keyword : gc prs
Complete list of metadata
Contributor : Marc Shapiro Connect in order to contact the contributor
Submitted on : Thursday, January 7, 2010 - 9:42:50 AM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Friday, June 18, 2010 - 12:28:19 AM


Files produced by the author(s)


  • HAL Id : inria-00444641, version 1



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⟩



Record views


Files downloads