A distributed garbage collection algorithm
Proc. of a conference on Functional programming languages and computer architecture
Highly available distributed services and fault-tolerant distributed garbage collection
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Garbage collection in a distributed environment
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Distributed garbage collection using reference counting
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Incremental incrementally compacting garbage collection
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
"Algorithms for on-the-fly garbage collection" revisited
Information Processing Letters
Garbage collection: an exercise in distributed, fault-tolerant programming
Garbage collection: an exercise in distributed, fault-tolerant programming
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
Incremental distribution of timestamp packets: a new approach to distributed garbage collection
OOPSLA '89 Conference proceedings on Object-oriented programming systems, languages and applications
Real-time garbage collection on general-purpose machines
Journal of Systems and Software
Mark scan garbage collection on a distributed architecture
Lisp and Symbolic Computation
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
Mostly parallel garbage collection
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Distributed copying garbage collection
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
List processing in real time on a serial computer
Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
Analysis of an algorithm for real time garbage collection
Communications of the ACM
An efficient, incremental, automatic garbage collector
Communications of the ACM
Mark DURING Sweep rather than Mark THEN Sweep
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Garbage collection and task deletion in distributed applicative processing systems
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Robust, distributed references and acyclic garbage collection
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Locality, causality and continuations
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
A distributed garbage collector for active objects
OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
Higher-order distributed objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Collecting cyclic distributed garbage by controlled migration
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Indirect distributed garbage collection: handling object migration
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partitioned garbage collection of a large object store
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Collecting distributed garbage cycles by back tracing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Research Demonstration of a Hardware Reference-Counting Heap
Lisp and Symbolic Computation
PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel 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
An implementation of complete, asynchronous, distributed garbage collection
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
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
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
Detecting distributed cycles of garbage in large-scale systems
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Large causality: ordering broadcasts and messages
EW 5 Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring
Using passive object garbage collection algorithms for garbage collection of active objects
Proceedings of the 3rd international symposium on Memory management
Efficient parallel global garbage collection on massively parallel computers
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Phoenix: a parallel programming model for accommodating dynamically joining/leaving resources
Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming
Partitioned garbage collection of a large stable heap
IWOOOS '96 Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96)
A unified theory of garbage collection
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Asynchronous Complete Distributed Garbage Collection
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Birrell's distributed reference listing revisited
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hierarchical real-time garbage collection
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Garbage collection and DSM consistency
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Asynchronous sequential processes
Information and Computation
Garbage collecting the grid: a complete DGC for activities
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Garbage collecting the grid: a complete DGC for activities
MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
Distributed garbage collection for mobile actor systems: the pseudo root approach
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
| Hi-index | 0.00 |
Distributed symbolic computations involve the existence of remote references allowing an object, local to a processor, to designate another object located on another processor. To reclaim inaccessible objects is the non trivial task of a distributed Garbage Collector (GC). We present in this paper a new distributed GC algorithm which (i) is fault-tolerant, (ii) is largely independent of how a processor garbage collects its own data space, (iii) does not need centralized control nor global stop-the-world synchronization, (iv) allows for multiple concurrent active GCs, (v) does not require to migrate objects from processor to processor and (vi) eventually reclaims all inaccessible objects including distributed cycles.These results are mainly obtained through the concept of a group of processors (or processes). Processors of a same group cooperate together to a GC inside this group; this GC is conservative with respect to the outside of the group. A processor contributes to the global GC of all groups to which it belongs. Garbage collection on small groups reclaims quickly locally distributed garbage clusters, while garbage collection on large groups ultimately reclaims widely distributed garbage clusters, albeit more slowly. Groups can be reorganized dynamically, in particular to tolerate failures of some member processors. These properties make the algorithm usable on very large and evolving networks of processors. Other than distributed symbolic computations, possible applications include for example distributed file or database systems.