The Open UniversitySkip to content

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 June 1987, Eindhoven, The Netherlands, Springer-Verlag, pp. 176–187.

DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


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.

Item Type: Conference Item
Copyright Holders: 1987 Springer-Verlag
ISSN: 0302-9743
Extra Information: PARLE Parallel Architectures and Languages Europe
Volume I1: Parallel Languages
Eindhoven, The Netherlands, June 15-19, 1987
Edited by J.W. de Bakker, A.J. Nijman and R C. Treleaven
New York : Springer-Verlag, 1987
Lecture Notes in Computer Science 259
Keywords: garbage collection
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Item ID: 33664
Depositing User: David Bevan
Date Deposited: 31 May 2012 08:39
Last Modified: 04 Nov 2015 10:35
Share this page:


Scopus Citations

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340