Distributed garbage collection using reference counting

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

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.
Original languageEnglish
Title of host publicationPARLE Parallel Architectures and Languages Europe
Subtitle of host publicationVolume II: Parallel Languages
EditorsJ. W. de Bakker, A. J. Nijman, P. C. Treleaven
Place of PublicationCham, Switzerland
PublisherSpringer
Pages176-187
Number of pages12
ISBN (Electronic)9783540471813
ISBN (Print)9783540179450
DOIs
Publication statusPublished - 1 May 1987

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume259
ISSN (Print)0302-9743

Keywords

  • distributed memory
  • garbage collection
  • reference counting

Fingerprint

Dive into the research topics of 'Distributed garbage collection using reference counting'. Together they form a unique fingerprint.

Cite this