Lins RD "Lazy cyclic reference counting" Journal of Universal Computer Science 9 (8): 813-828 2003

[Eugene Garfield]

E-mail : Lins RD - rdl at ee.ufpe.br

Title: Lazy cyclic reference counting

Author(s): Lins RD

Source: JOURNAL OF UNIVERSAL COMPUTER SCIENCE 9 (8): 813-828 2003

Document Type: Article      Language: English

Abstract: Reference counting is a widely employed memory management
technique, in which garbage collection operations are interleaved with
computation. Standard reference counting has the major drawback of being
unable to handle cyclic structures. This paper presents an important
optimisation to a recently published algorithm for cyclic reference
counting. Proofs of the correctness of the original and lazy algorithms are
provided, together with performance figures.
Author Keywords: garbage collection; reference counting; cycles; memory
management


Addresses: Lins RD (reprint author), Univ Fed Pernambuco, Recife, PE Brazil
Univ Fed Pernambuco, Recife, PE Brazil
E-mail Addresses: rdl at ee.ufpe.br

Publisher: SPRINGER, 233 SPRING STREET, NEW YORK, NY 10013 USA,
http://www.springeronline.com
Discipline: COMPUTER SCIENCE & ENGINEERING

CC Editions/Collections:  Engineering, Computing & Technology (ECT)
IDS Number: 958FW

ISSN: 0948-695X


Cited References:
BACON DF, 2001, LNCS, V2072.
BACON DF, 2001, P SIGPLAN C PROGR LA.
BROWNBRIDGE DR, 1985, LECT NOTES COMPUTER, V201, P273.
COLLINS GE, 1960, COMMUN ACM, V3, P655.
JONES RE, 1996, GARBAGE COLLECTION A.
LINS RD, UNPUB ANAL PERFORMAN.
LINS RD, 1992, INFORM PROCESS LETT, V44, P215.
LINS RD, 1993, INFORM PROCESS LETT, V46, P19.
LINS RD, 2002, INFORM PROCESS LETT, V83, P145.
LINS RD, 2002, P 14 S COMP ARCH HIG.
LINS RD, 2003, LECT NOTES COMPUT SC, V2565, P650.
MARTINEZ AD, 1990, INFORM PROCESS LETT, V34, P31.
MCBETH JH, 1963, COMMUN ACM, V6, P575.
SALKILD JD, 1987, THESIS U COLL LONDON.
SALZANO JA, 2002, P SBLP 2002 JUN, P233.
TURNER DA, 1979, SOFTWARE PRACTICE EX, V9, P31.