School of Computing

Generational cyclic reference counting

Rafael D Lins

Technical Report 22-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, September 1992.

Abstract

In this paper, we introduce the concept of the age of a cell to cyclic reference counting. Lifetime figures vary from language to language and program to program, but usually between 80 to 98 percent of all newly-allocated objects die within a few million instructions, or before another megabyte has been allocated. The majority of objects die even younger, within tens of kilobytes of allocation. Age information brings the advantage of selecting the youngest cell in the queue, increasing the likelihood of running mark-scan on garbage cells. We also use the age information as a way of detecting the existence of cycles during the mark phase. This information allows the algorithm to perform the scan phase more efficiently.

(Submitted to Information Processing Letters)

Download publication 39 kbytes

Bibtex Record

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

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

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

Last Updated: 21/03/2014