Algorithms for on-the-fly garbage collection
ACM Transactions on Programming Languages and Systems (TOPLAS)
A distributed garbage collection algorithm
Proc. of a conference on Functional programming languages and computer architecture
The complexity of using forwarding addresses for decentralized object finding
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
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
"Algorithms for on-the-fly garbage collection" revisited
Information Processing Letters
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
Mark scan garbage collection on a distributed architecture
Lisp and Symbolic Computation
Modules, objects and distributed programming: issues in RPC and remote object invocation
Software—Practice & Experience
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
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
Robust, distributed references and acyclic garbage collection
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
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)
Garbage collection in distributed EZ
Proceedings of the 13th international conference on Computer science 2 : research and applications: research and applications
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
A protocol for distributed reference counting
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Distributed copying garbage collection
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Orca: a language for distributed programming
ACM SIGPLAN Notices
Garbage Collection in a Distributed Object-Oriented System
IEEE Transactions on Knowledge and Data Engineering
Indirect Mark and Sweep: A Distributed GC
IWMM '95 Proceedings of the International Workshop on Memory Management
Garbage Collection on an Open Network
IWMM '95 Proceedings of the International Workshop on Memory Management
Experience with a Fault-Tolerant Garbage Collector in a Distributed Lisp System
IWMM '92 Proceedings of the International Workshop on Memory Management
Allocation Regions & Implementation Contracts
IWMM '92 Proceedings of the International Workshop on Memory Management
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
Mark DURING Sweep rather than Mark THEN Sweep
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures
Garbage collection in a large LISP system
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Garbage collection and task deletion in distributed applicative processing systems
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Hierarchical distributed reference counting
Proceedings of the 1st international symposium on Memory 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
Formal Methods in System Design
Supporting dynamic parallel object arrays
Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande
Tree Rerooting in Distributed Garbage Collection: Implementation and Performance Evaluation
Higher-Order and Symbolic Computation
Agents, Crawlers, and Web Retrieval
CIA '02 Proceedings of the 6th International Workshop on Cooperative Information Agents VI
| Hi-index | 0.00 |
In new distributed systems, object mobility is usually allowed and is sometimes used by the underlying object manager system to benefit from object access locality. On the other hand, in-transit references to objects can exist at any moment in asynchronous distributed systems. In the presence of object mobility and in-transit references, many garbage collector (GC) algorithms fail to operate correctly. Others need to use the system's object finder to find the objects while performing their work. As a general principle, a GC should never interfere with object manager polices (such as forcing migration or fixing an object to a given processor). However, if the GC uses the object finder, it will change the access pattern of the system, and eventually it could foul the global allocation policy. In this article we propose a new GC family, Indirect Garbage Collectors, allowing to separate the problems of object management (placement, replication, and retrieval) from garbage collection. This property allows our algorithms to be implemented on top of almost any existent distributed object system, without having to use the object finder.