Distributed garbage collection using reference counting
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
An efficient garbage collection scheme for parallel computer architectures
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Garbage collection in an uncooperative environment
Software—Practice & Experience
Generational reference counting: a reduced-communication distributed storage reclamation scheme
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
A multicomputer garbage collector for a single-assignment language
International Journal of Parallel Programming
Indirect reference counting: a distributed garbage collection algorithm
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
Active messages: a mechanism for integrated communication and computation
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The derivation of distributed termination detection algorithms from garbage collection schemes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Indirect distributed garbage collection: handling object migration
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Nexus approach to integrating multithreading and communication
Journal of Parallel and Distributed Computing - Special issue on multithreading for multiprocessors
COBRA fundamentals and programming
COBRA fundamentals and programming
Garbage collecting the world: one car at a time
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A protocol for distributed reference counting
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Revised report on the algorithmic language scheme
ACM SIGPLAN Lisp Pointers
A Survey of Distributed Garbage Collection Techniques
IWMM '95 Proceedings of the International Workshop on Memory Management
Incremental Collection of Mature Objects
IWMM '92 Proceedings of the International Workshop on Memory Management
Finalization in the Collector Interface
IWMM '92 Proceedings of the International Workshop on Memory Management
NeXeme: A Distributed Scheme Based on Nexus
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
MOS '96 Selected Presentations and Invited Papers Second International Workshop on Mobile Object Systems - Towards the Programmable Internet
SSP Chains: Robust, Distributed References Supporting Acyclic Garbage Collection
SSP Chains: Robust, Distributed References Supporting Acyclic Garbage Collection
Design and semantics of quantum: a language to control resource consumption in distributed computing
DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
Hierarchical distributed reference counting
Proceedings of the 1st international symposium on Memory management
Tree Rerooting in Distributed Garbage Collection: Implementation and Performance Evaluation
Higher-Order and Symbolic Computation
Using Ambients to Control Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
| Hi-index | 0.00 |
We present a new distributed garbage collection algorithm that is able to reorganise diffusion trees and to support mobile objects. It has a modular design comprising three components: a reliable transport mechanism, a reference-counting based distributed garbage collector for non-mobile objects, and an extra layer that provides mobility. The algorithm is formalised by an abstract machine and is proved to be correct. The safety property ensures that an object may not be reclaimed as long as it is referred to locally or remotely. The liveness property guarantees that unreachable objects will eventually be reclaimed. The mobility property certifies that messages are always forwarded towards more recent mobile object positions.