Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Generational garbage collection for Haskell
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
| Hi-index | 0.00 |
We present an analytical model that allows to compare all known garbage collection (GC) algorithms w.r.t. various performance measures. The overhead functions are natural and accurate; natural in the sense that they are given in terms of easy to measure and tune parameters, accurate in the sense that they account for all relevant sources of time and space overhead of the different algorithms. Space overhead accounted for includes mark bits, mark stack, reference count bits/tables, entry tables for area-GC, object tables etc. as well as storage fragmentation. Time overhead components are e.g. time to mark/scan/copy nodes, update reference counts, check for forwarding pointers, synchronization costs etc.