School of Computing

Cyclic weighted reference counting without delay

Richard Jones and Rafael D Lins

Technical Report 28-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, November 1992.

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.

Download publication 69 kbytes

Bibtex Record

@techreport{122,
author = {Richard Jones and Rafael D Lins},
title = {Cyclic Weighted Reference Counting without Delay},
month = {November},
year = {1992},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1992/122},
    address = {University of Kent, Canterbury, UK},
    hensa_abstractfilename = {pub/misc/ukc.reports/comp.sci/abstracts/28-92},
    hensa_ftpaddress = {unix.hensa.ac.uk},
    hensa_reportfilename = {pub/misc/ukc.reports/comp.sci/reports/28-92.ps.Z},
    institution = {University of Kent, Computing Laboratory},
    number = {28-92*},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014