SSP Chains: Robust, Distributed References Supporting Acyclic Garbage Collection

Authors:
M. Shapiro;P. Dickman;D. Plainfosse
Affiliations:
INRIA;INRIA;INRIA
Venue:
SSP Chains: Robust, Distributed References Supporting Acyclic Garbage Collection
Year:
1993

Citing 0
Cited 7

Hierarchical distributed reference counting

Proceedings of the 1st international symposium on Memory management
An efficient hierarchical scheme for locating highly mobile users

Proceedings of the seventh international conference on Information and knowledge management
A distributed garbage collector with diffusion tree reorganisation and mobile objects

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
System support for transparency and network-aware adaptation in mobile environments

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Using passive object garbage collection algorithms for garbage collection of active objects

Proceedings of the 3rd international symposium on Memory management
Chain of Responsibility

IEEE Internet Computing
Garbage collection and DSM consistency

OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

SSP chains are a novel technique for referencing objects in a distributed system. To client software, any object reference appears to be a local pointer; when the target is remote, an SSP chain adds an indeterminate number of levels of indirection. Copying a reference across the distributed system extends an SSP chain at one end; migrating the target object extends it at the other end. Invocation through an SSP chain is efficient: each stage of an SSP chain contains location information and log chains are short-cut at invocation time. These actions require (almost) no extra messages in addition to those of the client application. The rules for creating, using, modifying and deleting SSP chains are stated precisely and maintain well-defined invariants. The invariants hold even in the presence of message failures (loss, duplication, late delivery); after a crash, the existence invariants must be re-established. SSP chains support distributed garbage collection (GC); we present a robust distributed variant of reference counting. The techniques presented here are cheap, robust, widely applicable, and scalable.