Skip to main content

Cyclic Weighted Reference Counting without Delay

Jones, Richard E. and Lins, Rafael D. (1992) Cyclic Weighted Reference Counting without Delay. Technical report. UKC, University of Kent, Canterbury, UK 28-92*. (doi:28-92*) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:21024)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL
http://www.cs.kent.ac.uk/pubs/1992/122/index.html

Abstract

Weighted Reference Counting is a low communication distributed storage reclamation scheme for loosely-couple multiprocessors. The algorithm we present herein extends weighted reference counting to allow the collection of cyclic data structures. To do so, the algorithm identifies candidate objects that may be part of cycles and performs a tricolour mark-scan on their subgraph in a lazy manner to discover whether the subgraph is still in use. The algorithm is concurrent in the sense that multiple useful computation processes and garbage collection processes can be performed simultaneously.

Item Type: Monograph (Technical report)
DOI/Identification number: 28-92*
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Richard Jones
Date Deposited: 04 Aug 2009 18:41 UTC
Last Modified: 16 Nov 2021 09:59 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21024 (The current URI for this page, for reference purposes)
Jones, Richard E.: https://orcid.org/0000-0002-8159-0297
  • Depositors only (login required):