This seminar report presents adoptions of uniprocessor garbage collection techniques which are able to operate in a new context: distributed systems. We see that their application to distributed system poses new problems and that there is currently no algorithm available solving, or even addressing, all of them. The presented algorithms are structured according to their belonging family: refere...

Distributed garbage collection over a message passage network i s discussed in this paper. Traditionally, this can be done b y reference counting, which is fast but cannot reclaim cyclic structures or b y graph traversal, e.g. mark-and-sweep or time stamping, which is capable of reclaiming cyclic structures but is slow. We propose a combined scheme which is fast in reclaiming acyclic garbage an...