@inproceedings{062984ad7a754542945f0e5051699d93,
title = "Distributed garbage collection using reference counting",
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.",
keywords = "distributed memory, garbage collection, reference counting",
author = "DI Bevan",
year = "1987",
month = may,
day = "1",
doi = "10.1007/3-540-17945-3_10",
language = "English",
isbn = "9783540179450",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "176--187",
editor = "{de Bakker}, {J. W.} and Nijman, {A. J.} and Treleaven, {P. C.}",
booktitle = "PARLE Parallel Architectures and Languages Europe",
}