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.

URL:	http://www.springerlink.com/content/744146w15h87w1...
DOI (Digital Object Identifier) Link:	http://dx.doi.org/doi:10.1007/3-540-17945-3_10
Google Scholar:	Look up in Google Scholar

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.

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 pp.176-187
Keywords:	garbage collection
Academic Unit/Department:	Mathematics, Computing and Technology
Item ID:	33664
Depositing User:	David Bevan
Date Deposited:	31 May 2012 08:39
Last Modified:	31 May 2012 08:39
URI:	http://oro.open.ac.uk/id/eprint/33664

Actions (login may be required)

	View Item
	Public: Report issue / request change

Policies | Disclaimer