Cyclic Reference Counting With Lazy Mark-Scan

Lins, R.D. (1992) Cyclic Reference Counting With Lazy Mark-Scan. Information Processing Letters, 44 (4). pp. 215-220. ISSN 0020-0190. (Full text available)

PDF
Download (108kB)
[img]
Preview
Postscript
Download (89kB)
[img]
Preview
Official URL
http://dx.doi.org/10.1016/0020-0190(92)90088-D

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.

Item Type: Article
Uncontrolled keywords: Compilers; garbage collection; functional programming
Subjects: Q Science > QA Mathematics (inc Computing science)
Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing
Depositing User: M. Nasiriavanaki
Date Deposited: 29 Aug 2009 18:17
Last Modified: 06 Sep 2011 04:18
Resource URI: http://kar.kent.ac.uk/id/eprint/22347 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year