A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Filters
Cyclic reference counting with lazy mark-scan
1992
Information Processing Letters
Preserved Fulltext
We present an algorithm, called cyclic reference c ounting with lazy mark-scan, that removes the drawback of running mark-scan every time a pointer to a cell with multiple references is deleted. ...
Conclusions The e ciency of the algorithm presented in this paper is much higher than the original one for cyclic reference counting with local mark-scan. ...
doi:10.1016/0020-0190(92)90088-d
fatcat:6ro2xnmibbcgdopmyxkjbtw5fa
Generational cyclic reference counting
1993
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Proof of Correctness The generational algorithm can be seen as a conservative extension to the algorithm of cyclic reference counting with lazy mark-scan 6] and to prove its correctness is trivial. ...
Making mark-scan lazy 6] removes the drawback of running mark-scan every time a pointer to a cell with multiple references is deleted, by placing a reference to these cells onto a queue. ...
doi:10.1016/0020-0190(93)90190-k
fatcat:s7qqo2q7jzb5xb72tukzfdspse
A shared memory architecture for parallel cyclic reference counting
1991
Microprocessing and Microprogramming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An informal proof of the correctness of thc cyclic referenct' count with local mark-scan algorithm appcars in th <' original papcr [8) . ...
Copy increments the reference count of T. AlgorithmicaUy we have, Reference [8] presents a simple algorithm for cyclic reference counting. ...
doi:10.1016/0165-6074(91)90322-k
fatcat:ybp5qexm6fdo3ab75v4df6ufzm
Lazy memo-functions
[chapter]
1985
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We call our variant "lazy memo-functions" since they are suitable for use in systems with lazy evaluation. Lazy memo-functions are much more useful than the conventional kind. ...
They can be used to define functions on cyclic structures in a natural way, and to allow modular versions of algorithms to be used when the only efficient alternative is to destroy the algorithm's structure ...
It follows that references from memo-tables to stored arguments must not
count.
The
problem lles with references from memo-tables to stored results. ...
doi:10.1007/3-540-15975-4_34
fatcat:sfnytob5hvgk7ny2lmuffzy3ey
Down for the count?
2012
Proceedings of the 2012 international symposium on Memory Management - ISMM '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
This brings the performance of reference counting on par with that of a well tuned mark-sweep collector. ...
Our finding that reference counting can be made directly competitive with well tuned mark-sweep should shake the community's prejudices about reference counting and perhaps open new opportunities for exploiting ...
In particular, we explore strategies for: 1) storing the reference count, 2) maintaining an accurate count, and 3) dealing with cyclic data structures. ...
doi:10.1145/2258996.2259008
dblp:conf/iwmm/ShahriyarBF12
fatcat:ouo5hx6gkzehvpxx6gpfosbvwq
Down for the count? Getting reference counting back in the ring
2013
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
This brings the performance of reference counting on par with that of a well tuned mark-sweep collector. ...
Our finding that reference counting can be made directly competitive with well tuned mark-sweep should shake the community's prejudices about reference counting and perhaps open new opportunities for exploiting ...
In particular, we explore strategies for: 1) storing the reference count, 2) maintaining an accurate count, and 3) dealing with cyclic data structures. ...
doi:10.1145/2426642.2259008
fatcat:r6fdoet5ona4jdth6iyiwsuhom
Garbage Collection for Flexible Hard Real-Time Systems
2010
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On the other hand, the mark-sweep component periodically identifies cyclic garbage, which cannot be found by the reference counting component. ...
A hybrid garbage collection algorithm, which combines both reference counting and mark-sweep, is designed according to the new design criteria. ...
• By combining a fine grained lazy freeing reference counting collector with a
mark-sweep one, the problem of cyclic garbage can be resolved. ...
doi:10.1109/tc.2010.13
fatcat:mb2cj2up5vb6rbraplexl5rxy4
Garbage collecting the Internet: a survey of distributed garbage collection
1998
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Hybrid Collectors To tackle the memory leaks of cyclic structures, Martinez et al. [1990] combine simple reference counting with a local mark-scan. ...
,
color, control
heap & 2
queues
3*(rem refs copied)
ϩ
2*(suspect cyclic
rem refs)
None (doubtful)
MI phase Yes (lazy mark-
scan)
Addresses the issue
of synchronization
Shapiro, Dickman ...
doi:10.1145/292469.292471
fatcat:odrr35rx4jfyvihpguawcljqv4
Low-Latency, High-Throughput Garbage Collection (Extended Version)
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
2022
Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation
unpublished
doi:10.1145/3519939.3523440 fatcat:qkvpopgvardufhcthwzy322d2e
doi:10.1145/3519939.3523440 fatcat:qkvpopgvardufhcthwzy322d2e
It uses concurrent tracing as needed for identifying cyclic garbage. 3) To minimize pause times while allowing judicious copying of mature objects, LXR introduces remembered sets for reference counting ...
It then combats fragmentation with limited judicious stop-the-world copying. 2) LXR uses reference counting to achieve both scalability and immediacy, promptly reclaiming young and old objects. ...
We implement this invariant with mark bits stored in side metadata and by immediately marking and scanning any mature object that RC determines is dead if the SATB has not already marked it. ...
arXiv:2210.17175v1
fatcat:pdavwyxxebfjnkylsjpkxli5t4
A simple and efficient algorithm for cycle collection
2007
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper presents a new "lightweight" cyclic reference counting algorithm, which is based on partial tracing and deals with the cycle problem in a simpler and more efficient way. ...
The lack of collecting cyclic garbage is generally considered the major weakness of reference counting. ...
Lins' lazy cyclic reference counting [14] was the first widely acknowledged algorithm. ...
doi:10.1145/1273039.1273041
fatcat:le45saaeynf4nffujlzh6i5wui
Taking off the gloves with reference counting Immix
2013
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
reference counting of new objects and with backup tracing cycle collection. ...
The key innovations of RC Immix are 1) to combine traditional reference counts with per-line live object counts to identify reusable memory and 2) to eliminate fragmentation by integrating copying with ...
Prior work applies the weak generational hypothesis to reference counting by combining reference counting with a copying nursery [5] and by in-place mark-sweep tracing [25] . ...
doi:10.1145/2544173.2509527
fatcat:o5kry2qguffbppcf64ideozsbm
Taking off the gloves with reference counting Immix
2013
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications - OOPSLA '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
reference counting of new objects and with backup tracing cycle collection. ...
The key innovations of RC Immix are 1) to combine traditional reference counts with per-line live object counts to identify reusable memory and 2) to eliminate fragmentation by integrating copying with ...
Prior work applies the weak generational hypothesis to reference counting by combining reference counting with a copying nursery [5] and by in-place mark-sweep tracing [25] . ...
doi:10.1145/2509136.2509527
dblp:conf/oopsla/ShahriyarBYM13
fatcat:waojtab7w5brzdkqmb44k2ilje
Unrestricted pure call-by-value recursion
2008
Proceedings of the 2008 ACM SIGPLAN workshop on ML - ML '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As a consequence, some very appealing programming patterns that work well in lazy functional languages are hard to apply in a call-by-value setting, even though they might not be using laziness for any ...
On that basis we are able to demonstrate that highly recursive programming idioms such as combinator-based parsing are indeed compatible with call-by-value evaluation. ...
Acknowledgments We would like to acknowledge the insights and comments we have received from Mark Jones, Björn von Sydow, Iavor Diatchki, Brian Huffman, Tim Sheard, Jim Hook and Tom Hirschowitz during ...
doi:10.1145/1411304.1411309
dblp:conf/ml/NordlanderCG08
fatcat:yd4cf3i3qzckxexkhovd3fjgzy
A standard for a graph representation for functional programs
1988
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The graphs employed are compatible with FLIC and with the functional languages in use at Birmingham and Warwick. The textual format is designed to be transmittable easily across networks. ...
The data structures used in the authors' functional language graph reduction implementations are described, together with a standard notation for representing the graphs in atextual format. ...
The graph structure supports this scheme of reference counting (although it does not require it: mark-scan garbage collection schemes could be used if preferred, and the reference counts ignored). ...
doi:10.1145/44304.44311
fatcat:vi5rwqc2sbdkxhdmshdzinseya
Generic Pickling and Minimization
2006
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The pickler copies the nodes of a subgraph using a Cheney scan, replacing the real addresses in the abstract store with abstract addresses, counting from the start of the memory the graph is copied to. ...
A cyclic graph with the pickle constructing it is shown in Figure 1 (c). ...
doi:10.1016/j.entcs.2005.11.041
fatcat:jvvpu5ubwvddjhitpsftkasjiu
« Previous
Showing results 1 — 15 out of 1,021 results