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}
}
  • B. Zorn
  • Published 1993
  • Computer Science
  • Software: Practice and Experience
  • 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
    139 Citations
    Space efficient conservative garbage collection
    • 60
    • PDF
    Quantifying the performance of garbage collection vs. explicit memory management
    • 112
    • PDF
    Automatic vs. Explicit Memory Management: Settling the Performance Debate
    • 12
    • PDF
    Conservative garbage collection on distributed shared memory systems
    • Weimin Yu, A. Cox
    • Computer Science
    • Proceedings of 16th International Conference on Distributed Computing Systems
    • 1996
    • 11
    Customising Object Allocation
    • 9
    Safe manual memory management
    • 21
    • PDF
    Memory Management in the PoSSo Solver
    • 6
    • PDF
    The Garbage Collection Handbook: The art of automatic memory management
    • 214
    • PDF

    References

    SHOWING 1-10 OF 25 REFERENCES
    The Effect of Garbage Collection on Cache Performance
    • 51
    • PDF
    Garbage collection in a large LISP system
    • 273
    Garbage collection in an uncooperative environment
    • 665
    • PDF
    Fast fits--new methods for dynamic storage allocation
    • 44
    • PDF
    Simple generational garbage collection and fast allocation
    • 330
    • PDF
    Garbage Collection of Linked Data Structures
    • 259
    • PDF