Cyclic Reference Counting with Lazy Mark-Scan

Cyclic Reference Counting with Lazy Mark-Scan (1990)

by Rafael Lins

Venue:	Inf. Process. Lett
Citations:	25 - 6 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Cyclic Reference Counting with Lazy Mark-Scan	user correction - Legacy Corrections
AUTHOR NAME	Rafael Lins	user correction - Legacy Corrections
AUTHOR AFFIL	Dept. de Inform'atica- U.F.PE.- Recife- Brazil	user correction - Legacy Corrections
ABSTRACT	this paper is much higher than the original one for cyclic reference counting with local mark-scan. More shared cells will now be claimed directly, without any need for mark-scan. The deletion of the last pointer to a shared cell will recycle it immediately, regardless of whether there is a reference to it on the queue. The queue will be left basically with pointers to cycles and pointers to green cells in the free-list or recycled. In this case again, our algorithm performs far better than the original one. In the best case, only one local mark-scan will be performed per cycle, instead of as many as the number of external references to a cycle, as before. Acknowledgements	user correction - Legacy Corrections
YEAR	1990	user correction - Legacy Corrections
VENUE	Inf. Process. Lett	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
PAGES	215--220	INFERENCE
VOLUME	44	INFERENCE
TECH	Technical Report 75	INFERENCE
CITATIONS	7 found	ParsCit 1.0