关键词：释放提示；串行收集器；并行收集器；收集器算法；元数据
摘 要：Garbage collection is widely used and has largely been a boon for programmer productivity. However, traditional garbage collection is approaching both practical and theoretical performance limits. In practice, the maximum heap size and heap structure of large applications are in uenced as much by garbage collector behavior as by resource availability.We include a discussion of the design trade-o s inherent in our approach, and lessons to be learned from our collectors. We close with a discussion of several design variants which we have not been able to explore in depth, but believe would be worthwhile to explore in future work.
目 录：

1 Hinted Collection

1.1 Introduction

1.2 Background

1.3 The Hinted

Collector Algorithm

2 A Serial Collector

2.1 Design & Implementation

2.2 Evaluation

3 A Parallel Collector

3.1 Design & Implementation
3.2 Evaluation

4 Discussion

4.1 Memory Leaks

4.2 Manual Reasoning & Software Engineering

4.3 Metadata Design Alternatives

4.4 Explicit Hinted Object Sets & Hazard Pointers

5 Future Work

5.1 Direct Extensions

5.2 Advanced Collector Design Sketches

5.3 Alternate Approaches

Conclusion

Acknowledgments

Bibliography