An efficient reference counting solution to the distributed garbage collection problem

Research output: Contribution to journalArticlepeer-review

Abstract

A good programming language permits the programmer to concentrate on his application rather than on low-level implementation details. In particular, he does not have to concern himself with storage allocation because memory management is dealt with efficiently by the implementation of the language. To reclaim disused storage for reuse the implementation incorporates a garbage collection algorithm. When the language is implemented on a distributed multiprocessor architecture, this algorithm ideally collects garbage as soon as it is created and has minimal overheads in terms of space requirements and interprocess communications. We describe here an elegant algorithm with these properties which makes use of reference counting.
Original languageEnglish
Pages (from-to)179-192
Number of pages14
JournalParallel Computing
Volume9
Issue number2
DOIs
Publication statusPublished - 31 Jan 1989

Keywords

  • circular structures
  • distributed systems
  • garbage collection;
  • reference counting

Fingerprint

Dive into the research topics of 'An efficient reference counting solution to the distributed garbage collection problem'. Together they form a unique fingerprint.

Cite this