Cyclic reference counting

Authors:
Rafael Dueire Lins
Affiliations:
Departamento de Eletrônica e Sistemas, CTG, Universidade Federal de Pernambuco, 50740-530 Recife, PE, Brazil
Venue:
Information Processing Letters
Year:
2008

Citing 10
Cited 1

Cyclic reference counting for combinator machines

Proc. of a conference on Functional programming languages and computer architecture
Cyclic reference counting with local mark-scan

Information Processing Letters
Cyclic reference counting with lazy mark-scan

Information Processing Letters
Generational cyclic reference counting

Information Processing Letters
Garbage collection: algorithms for automatic dynamic memory management

Garbage collection: algorithms for automatic dynamic memory management
Managing Reentrant Structures Using Reference Counts

ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for overlapping and erasure of lists

Communications of the ACM
Letters to the editor: on the reference counter method

Communications of the ACM
An efficient algorithm for cyclic reference counting

Information Processing Letters
New algorithms and applications of cyclic reference counting

ICGT'06 Proceedings of the Third international conference on Graph Transformations

Finer Garbage Collection in Lindacap

International Journal of Information Technology and Web Engineering

Quantified Score

Hi-index	0.89

Visualization

Abstract

Reference counting is the memory management technique of most widespread use today. Its cyclic version is used from implementations of languages such as Java to the consistent management of web pages. This paper introduces the concept of ''critical link'' to largely optimize cyclic reference counting.