Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
List tracing in systems allowing multiple cell-types
Communications of the ACM
Communications of the ACM
An architecture for efficient Lisp list access
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
Research Demonstration of a Hardware Reference-Counting Heap
Lisp and Symbolic Computation
Memory management with explicit regions
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Java without the coffee breaks: a nonintrusive multiprocessor garbage collector
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
EW 5 Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring
Incremental garbage collection in massive object stores
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
An efficient algorithm for cyclic reference counting
Information Processing Letters
Garbage Collection in a Distributed Object-Oriented System
IEEE Transactions on Knowledge and Data Engineering
Concurrent Cycle Collection in Reference Counted Systems
ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
Decreasing Memory Overhead in Hard Real-Time Garbage Collection
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Minimal overhead garbage collection of complex list structure
ACM SIGPLAN Notices
An efficient on-the-fly cycle collection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 6th international symposium on Memory management
Information Processing Letters
An efficient multi-processor architecture for parallel cyclic reference counting
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
An efficient on-the-fly cycle collection
CC'05 Proceedings of the 14th international conference on Compiler Construction
New algorithms and applications of cyclic reference counting
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.00 |
Automatic storage management requires that one identify storage unreachable by a user's program and return it to free status. One technique maintains a count of the references from user's programs to each cell, since a count of zero implies the storage is unreachable. Reentrant structures are self-referencing; hence no cell in them will have a count of zero, even though the entire structure is unreachable. A modification of standard reference counting can be used to manaage the deallocation of a large class of frequently used reentrant structures, including two-way and circularly linked lists.All the cells of a potentially reentrant structure are considered as part of a single group for deallocation purposes. Information associated with each cell specifies its group membership. Internal references (pointers from one cell of the group to another) are not reference counted. External references to any cell of this group are counted as references to the group as a whole. When the external reference count goes to zero, all the cells of the group can be deallocated. This paper describes several ways of specifying group membership, properties of each implementation, and properties of mutable and immutable group membership.