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*. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
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)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 04 Aug 2009 18:41
Last Modified: 27 May 2014 13:53
Resource URI: http://kar.kent.ac.uk/id/eprint/21024 (The current URI for this page, for reference purposes)
ORCiD (Jones, Richard E.):
ORCiD (Lins, Rafael D.):
  • Depositors only (login required):