An empirical study of list structure in Lisp
Communications of the ACM
A time- and space-efficient garbage compaction algorithm
Communications of the ACM
An efficient, incremental, automatic garbage collector
Communications of the ACM
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
An efficient garbage compaction algorithm
Communications of the ACM
| Hi-index | 0.05 |
The two-pass compaction algorithm of F.L. Morris, which follows upon the mark phase in a garbage collector, may be modified to recover reference counts for a hybrid storage management system. By counting the executions of two loops in that algorithm where upward and downward references, respectively, are forwarded to the relocation address of one node, we can initialize a count of active references and then update it but once. The reference count may share space with the mark bit in each node, but it may not share the additional space required in each pointer by Morris's algorithm, space which remains unused outside the garbage collector.