The derivation of distributed termination detection algorithms from garbage collection schemes
ACM Transactions on Programming Languages and Systems (TOPLAS)
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
A time- and space-efficient garbage compaction algorithm
Communications of the ACM
A nonrecursive list compacting algorithm
Communications of the ACM
Starting with termination: a methodology for building distributed garbage collection algorithms
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
A Survey of Distributed Garbage Collection Techniques
IWMM '95 Proceedings of the International Workshop on Memory Management
Mosaic: A Non-Intrusive Complete Garbage Collector for DSM Systems
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Garbage collection for storage-oriented clusters
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Hi-index | 0.00 |
This paper discusses implementations of distributed garbage collectors derived using a methodology developed previously that involves mappings of distributed termination detection algorithms (DTAs) to local garbage collection schemes. Implementations produced by such mappings preserve the safety and completeness properties of the original local collectors. Through our collector implementations we have come to understand that the derivation technique extends to distributed collection schemes with heterogeneous local collector behaviour. Our contribution, reported here, is the construction of an experimental platform - the ProcessBase cache, implementations of the Task Balancing DTA, an extension to the methodology that minimises constraints on local collectors, together with two new mappings and their implementations.