Asynchronous Complete Distributed Garbage Collection
- 19 April 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 24a
Abstract
Most distributed garbage collection (DGC) algorithms are not complete as they fail to reclaim distributed cycles of garbage. Those that achieve such a level of completeness are very costly as they require either some kind of synchronization or consensus between processes. Others use mechanisms such as backtracking, global counters, a central server, distributed tracing phases, and/or impose additional load and restrictions on local garbage collection. All these approaches hinder scalability and/or performance significantly. We propose a solution to this problem, i.e., we describe a DGC algorithm capable of reclaiming distributed cycles of garbage asynchronously and efficiently. Our algorithm does not require any particular coordination between processes and it tolerates message loss. We have implemented the algorithm both on Rotor (a free source version of Microsoft .Net) and on OBIWAN (a platform supporting mobile agents, object replication and remote invocation); we observed that applications are not disrupted.Keywords
This publication has 16 references indexed in Scilit:
- OBIWAN: design and implementation of a middleware platformIEEE Transactions on Parallel and Distributed Systems, 2003
- The Memory Behavior of the WWW, or The WWW Considered as a Persistent Store2001
- Recent Advances in Distributed Garbage Collection2000
- Garbage collecting the InternetACM Computing Surveys, 1998
- Cyclic distributed garbage collection with group merger1998
- Collecting distributed garbage cycles by back tracing1997
- Collecting cyclic distributed garbage by controlled migration1995
- Garbage collection on an open networkLecture Notes in Computer Science, 1995
- Robust, distributed references and acyclic garbage collection1992
- A distributed garbage collection algorithmLecture Notes in Computer Science, 1985