By Topic

Garbage collection in the Larchant persistent distributed shared store

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ferreira, P. ; Project SOR, Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France ; Shapiro, M.

We study tracing garbage collection (GC) for a distributed shared memory (DSM) in order to provide persistence by reachability (PBR), in a large-scale distributed system. Within a general model of DSM, we specify a distributed tracing GC algorithm that scales, collects cycles, and is orthogonal to coherence. Its main features are: (i) piecewise collection of opportunistically-chosen subsets of the memory, (ii) each site collects independently of other sites, (iii) data replicas are collected independently and no operation is needed for GC purposes; and (iv) asynchrony of collection with respect to applications

Published in:

Distributed Computing Systems, 1995., Proceedings of the Fifth IEEE Computer Society Workshop on Future Trends of

Date of Conference:

28-30 Aug 1995