Abstract is missing.
- Modeling, analysis and throughput optimization of a generational garbage collectorDavid Vengerov. 1-9 [doi]
- A new approach to parallelising tracing algorithmsCosmin E. Oancea, Alan Mycroft, Stephen M. Watt. 10-19 [doi]
- Scalable support for multithreaded applications on dynamic binary instrumentation systemsKim M. Hazelwood, Greg Lueck, Robert Cohn. 20-29 [doi]
- Garbage collection in the next C++ standardHans-Juergen Boehm, Mike Spertus. 30-38 [doi]
- Precise garbage collection for CJon Rafkind, Adam Wick, John Regehr, Matthew Flatt. 39-48 [doi]
- Self-recovery in server programsVijay Nagarajan, Dennis Jeffrey, Rajiv Gupta. 49-58 [doi]
- Investigating the effects of using different nursery sizing policies on performanceXiaohua Guan, Witawas Srisa-an, ChengHuan Jia. 59-68 [doi]
- Placement optimization using data context collected during garbage collectionMauricio J. Serrano, Xiaotong Zhuang. 69-78 [doi]
- Efficient alias set analysis using SSA formNomair A. Naeem, Ondřej Lhoták. 79-88 [doi]
- Identification of logically related heap regionsMark Marron, Deepak Kapur, Manuel V. Hermenegildo. 89-98 [doi]
- A component model of spatial localityXiaoming Gu, Ian Christopher, Tongxin Bai, Chengliang Zhang, Chen Ding. 99-108 [doi]
- Two memory allocators that use hints to improve localityAlin Jula, Lawrence Rauchwerger. 109-118 [doi]
- Dynamic shape analysis via degree metricsMaria Jump, Kathryn S. McKinley. 119-128 [doi]
- Live heap space analysis for languages with garbage collectionElvira Albert, Samir Genaim, Miguel Gómez-Zamalloa. 129-138 [doi]
- Parametric heap usage analysis for functional programsLeena Unnikrishnan, Scott D. Stoller. 139-148 [doi]