Flexible reference-counting-based hardware acceleration for garbage collection

Proceedings - International Symposium on Computer Architecture

Volumn , Issue , 2009, Pages 418-428

  Joao, José A ^a   Mutlu, Onur ^b   Patt, Yale N ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Garbage collection; Reference counting

Indexed keywords

AUTOMATIC MEMORY MANAGEMENT; GARBAGE COLLECTION; GARBAGE COLLECTION ALGORITHM; GARBAGE COLLECTORS; HARDWARE ACCELERATION; MEMORY SPACE; PAUSE TIME; REAL-TIME APPLICATION; REFERENCE COUNTING; SECURITY ADVANTAGE; SOFTWARE TECHNIQUES;

COMPUTER ARCHITECTURE; COMPUTER HARDWARE; LINGUISTICS; REFUSE COLLECTION; WASTE DISPOSAL;

COMPUTER SOFTWARE;

EID: 70450284740     PISSN: 10636897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1555754.1555806     Document Type: Conference Paper

References (36)

1. A.-R. Adl-Tabatabai et al. Improving 64-bit Java IPF performance by compressing heap references. In CGO'04.
2. B. Alpern et al. The Jalapeño virtual machine. IBM Systems Journal, 39(1):211-238, 2000.
3. G. M. Amdahl. Validity of the single-processor approach to achieving large scale computing capabilities. In AFIPS Conference Proceedings, pages 483-485, 1967.
4. A. W. Appel. Simple generational garbage collection and fast allocation. SPE, 19(2):171-183, 1989.
5. K. Arnold and J. Gosling. The Java Programming Language. Addison-Wesley, 1996.
6. S. Blackburn et al. The DaCapo benchmarks: Java benchmarking development and analysis. In OOPSLA'06.
7. S. M. Blackburn, P. Cheng, and K. S. McKinley. Myths and realities: the performance impact of garbage collection. SIGMETRICS Perform. Eval. Rev., 32(1):25-36, 2004.
8. S. M. Blackburn et al. Wake up and smell the coffee: evaluation methodology for the 21st century. Commun. ACM, 51(8):83-89, 2008.
9. S. M. Blackburn and K. S. McKinley. Ulterior reference counting: fast garbage collection without a long wait. In OOPSLA'03.
10. D. Buytaert, K. Venstermans, L. Eeckhout, and K. D. Bosschere. Garbage collection hints. In HIPEAC'05.
11. J. M. Chang and E. F. Gehringer. Evaluation of an object-caching coprocessor design for object-oriented systems. In ICCD'93.
12. W. Chen, S. Bhansali, T. Chilimbi, X. Gao, and W. Chuang. Profile-guided proactive garbage collection for locality optimization. In PLDI'06.
13. J.-D. Choi, M. Gupta, M. Serrano, V. C. Sreedhar, and S. Midkiff. Escape analysis for Java. In OOPSLA'99.
14. C. Click, G. Tene, and M. Wolf. The pauseless GC algorithm. In VEE'05.
15. G. E. Collins. A method for overlapping and erasure of lists. Commun. ACM, 3(12):655-657, 1960.
16. L. P. Deutsch and D. G. Bobrow. An efficient, incremental, automatic garbage collector. Communications of the ACM, 19(9):522-526, 1976.
17. S. Z. Guyer and K. S. McKinley. Finding your cronies: static analysis for dynamic object colocation. In OOPSLA'04.
18. S. Z. Guyer, K. S. McKinley, and D. Frampton. Free-Me: a static analysis for automatic individual object reclamation. In PLDI'06.
19. X. Huang, S. M. Blackburn, K. S. McKinley, J. E. B. Moss, Z. Wang, and P. Cheng. The garbage collection advantage: improving program locality. In OOPSLA'04.
20. J. A. Joao, O. Mutlu, and Y. N. Patt. Flexible reference-counting-based hardware acceleration for garbage collection. Technical Report TR-HPS-2009-001, The University of Texas at Austin, Apr. 2009.
21. P. G. Joisha. Compiler optimizations for nondeferred reference-counting garbage collection. In ISMM'06.
22. P. G. Joisha. Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast. In ISMM'07.
23. R. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, 1996.
24. Y. Levanoni and E. Petrank. An on-the-fly reference counting collector for Java. In OOPSLA'01.
25. P. Magnusson, M. Christensson, J. Eskilson, D. Forsgren, G. Hallberg, J. Hogberg, F. Larsson, A. Moestedt, and B. Werner. Simics: A full system simulation platform. IEEE Computer, 35(2):50-58, Feb. 2002.
26. J. McCarthy. Recursive functions of symbolic expressions and their computation by machine, part I. Commun. ACM, 3(4):184-195, 1960.
27. J. McCarthy. History of LISP. In History of programming languages I, pages 173-185. ACM, 1981.
28. M. Meyer. A true hardware read barrier. In ISMM'06.
29. M. Meyer. A novel processor architecture with exact tag-free pointers. IEEE Micro, 24(3):46-55, 2004.
30. M. Meyer. An on-chip garbage collection coprocessor for embedded real-time systems. RTCSA, 00:517-524, 2005.
31. C. Peng and G. S. Sohi. Cache memory design considerations to support languages with dynamic heap allocation. Technical Report 860, CS Dept., University of Wisconsin-Madison, 1989.
32. W. J. Schmidt and K. D. Nilsen. Performance of a hardware-assisted real-time garbage collector. In ASPLOS'94.
33. S. Stanchina and M. Meyer. Mark-sweep or copying?: a "best of both worlds" algorithm and a hardware-supported real-time implementation. In ISMM'07.
34. D. Syme, A. Granicz, and A. Cisternino. Expert F#. Apress, 2007.
35. D. Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. SIGPLAN Not., 19(5):157-167, 1984.
36. D. S. Wise, B. C. Heck, C. Hess, W. Hunt, and E. Ost. Research demonstration of a hardware reference-counting heap. Lisp and Symbolic Computation, 10(2):159-181, 1997.