A distributed garbage collection algorithm

TL;DR: This work describes a number of hybrid schemes improving over distributed reference counting algorithms in order to collect cyclic garbage, and describes tracing-based techniques derived from uniprocessor tracing- based techniques.

TL;DR: A fault-tolerant garbage collection method for a distributed heap that can be used in any application in which the property of interest is stable: once the property becomes true, it remains true forever.

TL;DR: An elegant algorithm is described which makes use of reference counting to reclaim disused storage for reuse and collects garbage as soon as it is created and has minimal overheads in terms of space requirements and interprocess communications.

TL;DR: Efficient, programming language-independent, location-transparent references are proposed as a substitute for pointers in distributed applications that provide the semantics of normal pointers for both local and distributed, transient and persistent objects.

TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.

TL;DR: In this paper, the authors present a real-time garbage collection algorithm that makes storage for short-lived objects cheaper than storage for longlived objects, and operates in real time.

TL;DR: In this paper, a technique is developed which allows nearly all of the activity needed for garbage detection and collection to be performed by an additional processor operating concurrently with the processor devoted to the computation proper.

TL;DR: Algorithms for a multiprocessing compactifying garbage collector are presented and discussed and particular attention is given to the problems of marking and relocating list cells while another processor may be operating on them.