(Enter summary)
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 ... (Update)
Context of citations to this paper: More
...a simple partial mark sweep algorithm wherein a mark sweep collector is invoked to reclaim the cycles missed by reference counting. Lins [8] created a hybrid reference counting mark sweep algorithm which is O(n ) in the worst case, based on an algorithm of Martinez [10]...
Cited by: More
Resource Management in Open Tuple Space Systems - de Menezes (1999)
(Correct)
On-the-Fly Cycle Collection Revisited - Paz, Bacon, Kolodner, Petrank.. (2003)
(Correct)
Concurrent Cycle Collection in Reference Counted Systems - Bacon, Rajan (2001)
(Correct)
Similar documents (at the sentence level):
42.9%: Generational Cyclic Reference Counting - Lins (1992)
(Correct)
Active bibliography (related documents): More All
0.5: the Garbage Collection Bibliography - Richard Jones (2003)
(Correct)
0.4: Cyclic Weighted Reference Counting without Delay - Jones, Lins (1992)
(Correct)
0.2: A Multi-Processor Shared Memory Architecture for Parallel.. - Rafael Lins Dept (1992)
(Correct)
Similar documents based on text: More All
0.1: Garbage Collection - Sagiv (1998)
(Correct)
0.1: A Survey of Distributed Garbage Collection Techniques - Plainfossé, al. (1994)
(Correct)
0.0: GM-C - A Graph Categorical Multi-Combinator Machine - Musicante, Lins (1989)
(Correct)
Related documents from co-citation: More All
12: Cyclic reference counting with local mark-scan (context) - Martinez, Wachenchauzer et al. - 1990
10: Managing reentrant structures using reference counts (context) - Bobrow - 1980
10: Multiprocessing compactifying garbage collection (context) - Jr - 1975
BibTeX entry: (Update)
Rafael D. Lins. Cyclic reference counting with lazy mark-scan. Technical Report 75, University of Kent, Canterbury, United Kingdom, June 1990. To appear in Information Processing Letters. http://citeseer.ist.psu.edu/lins90cyclic.html More
@article{ lins92cyclic,
author = "Rafael D. Lins",
title = "Cyclic Reference Counting with Lazy Mark-Scan",
journal = "Information Processing Letters",
volume = "44",
number = "4",
publisher = "North Holland",
pages = "215--220",
year = "1992",
url = "citeseer.ist.psu.edu/lins90cyclic.html" }
Citations (may not include all citations):
143
A new implementation technique for applicative languages (context) - Turner - 1979
81
Garbage collection of linked data structures (context) - Cohen - 1981
20
Some practical methods for rapid combinator reduction (context) - Stoye, Clarke et al. - 1984
15
Cyclic reference counting with local mark-scan (context) - Martinez, Wachenchauzer et al. - 1990
9
A multi-processor shared memory architecture for parallel cy..
- Lins - 1992
6
A shared memory architecture for parallel cyclic reference c.. (context) - Lins - 1991
6
A comparative study of algorithms for cyclic reference count.. (context) - Lins, Vasques - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://hypatia.dcs.qmw.ac.uk/SEL-HPC/Articles/GeneratedHtml/functional.gc.html): More
Generational Cyclic Reference Counting - Lins (1992)
(Correct)
The Incremental Garbage Collection of Processes - Baker, Hewitt (1977)
(Correct)
Stop-and-copy and One-bit Reference Counting - David Wise (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC