Distributed garbage collection using reference counting

Bevan, D. I. (1987). Distributed garbage collection using reference counting. In: PARLE: Parallel Architectures and Languages Europe, 15-19 Jun 1987, Eindhoven, The Netherlands, Springer-Verlag, pp. 176–187.

DOI: https://doi.org/10.1007/3-540-17945-3_10

URL: http://www.springerlink.com/content/744146w15h87w1...

Abstract

We describe here an elegant algorithm for the real-time garbage collection of distributed memory. This algorithm makes use of reference counting and is simpler than distributed mark-scan algorithms. It is also truly real-time unlike distributed mark-scan algorithms. It requires no synchronisation between messages and only sends a message between nodes when a reference is deleted. It is also relatively space efficient using at most five bits per reference.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI