The measured cost of conservative garbage collection
@article{Zorn1993TheMC, title={The measured cost of conservative garbage collection}, author={B. Zorn}, journal={Software: Practice and Experience}, year={1993}, volume={23} }
Because dynamic memory management is an important part of a large class of computer programs, high‐performance algorithms for dynamic memory management have been, and will continue to be, of considerable interest. Experience indicates that for many programs, dynamic storage allocation is so important that programmers feel compelled to write and use their own domain‐specific allocators to avoid the overhead of system libraries. As an alternative to explicit storage management techniques… CONTINUE READING
Topics from this paper
139 Citations
Quantifying the performance of garbage collection vs. explicit memory management
- Computer Science
- OOPSLA '05
- 2005
- 112
- PDF
Conservative garbage collection on distributed shared memory systems
- Computer Science
- Proceedings of 16th International Conference on Distributed Computing Systems
- 1996
- 11
The Garbage Collection Handbook: The art of automatic memory management
- Computer Science
- Chapman and Hall / CRC Applied Algorithms and Data Structures Series
- 2011
- 214
- PDF
References
SHOWING 1-10 OF 25 REFERENCES
Combining generational and conservative garbage collection: framework and implementations
- Computer Science
- POPL '90
- 1989
- 106
Simple generational garbage collection and fast allocation
- Computer Science
- Softw. Pract. Exp.
- 1989
- 330
- PDF
Efficient implementation of the first-fit strategy for dynamic storage allocation
- Computer Science
- TOPL
- 1989
- 39
- PDF