Overlooking roots: A framework for making nondeferred reference-counting garbage collection fast

International Symposium on Memory Management, ISMM

Volumn , Issue , 2007, Pages 141-157

  Joisha, Pramod G ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Reference counting; Static analysis

Indexed keywords

DATA STORAGE EQUIPMENT; JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; REFUSE COLLECTION; REFUSE DISPOSAL; WASTE DISPOSAL;

GARBAGE COLLECTION (GC); INTERNATIONAL SYMPOSIUM; MEMORY-MANAGEMENT; TEST SUITES; WORST CASE;

CODES (SYMBOLS);

EID: 42149157721     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1296907.1296926     Document Type: Conference Paper

References (22)

1. Jeffrey M. Barth. Shifting Garbage Collection Overhead to Compile Time. Communications of the ACM, 20(7):513-518, July 1977.
2. Don Box and Chris Sells. Essential .NET: The Common Language Runtime. Addison-Wesley Publishing Company, Inc., Redwood City, CA 94065, USA, 2003.
3. David R. Chase, Mark Wegman, and F. Kenneth Zadeck. Analysis of Pointers and Structures. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 345-359. Association for Computing Machinery, June 1990.
4. George E. Collins. A Method for Overlapping and Erasure of Lists. Communications of the ACM, 3(12):655-657, December 1960.
5. L. Peter Deutsch and Daniel G. Bobrow. An Efficient, Incremental Automatic Garbage Collector. Communications of the ACM, 19(9):522-526, September 1976.
6. H. Gelernter, J. R. Hansen, and C. L. Gerberich. A FORTRAN-Compiled List-Processing Language. Journal of the ACM, 7(2):87-101, April 1960.
7. Sanjay Ghemawat, Keith H. Randall, and Daniel J. Scales. Field Analysis: Getting Useful and Low-Cost Interprocedural Information. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 334-344. Association for Computing Machinery, June 2000.
8. Rakesh Ghiya and Laurie J. Hendren. Is it a Tree, a DAG, or a Cyclic Graph? A Shape Analysis for Heap-Directed Pointers in C. In Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 1-15. Association for Computing Machinery, January 1996.
9. Laurie J. Hendren and Alexandra Nicolau. Parallelizing Programs with Recursive Data Structures. IEEE Transactions on Parallel and Distributed Systems, 1(1):35-47, January 1990.
10. Pramod G. Joisha. Compiler Optimizations for Nondeferred Reference-Counting Garbage Collection. In Proceedings of the 5th International Symposium on Memory Management, pages 150-161. Association for Computing Machinery, June 2006.
11. Neil D. Jones and Steven S. Muchnick. Flow Analysis and Optimization of LISP-like Structures. In Steven S. Muchnick and Neil D. Jones, editors, Program Flow Analysis: Theory and Applications, pages 102-131. Prentice-Hall, Inc., Englewood Cliffs, NJ 07458, USA, 1981.
12. John B. Kam and Jeffrey D. Ullman. Monotone Data Flow Analysis Frameworks. Acta Informatica, 7:305-317, January 1977.
13. Yossi Levanoni and Erez Petrank. An On-the-fly Reference Counting Garbage Collector for Java. In Proceedings of the 16th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 367-380, October 2001.
14. Tim Lindholm and Frank Yellin. The Java Virtual Machine Specification, Second Edition. The Java Series. Addison-Wesley Publishing Company, Inc., 1999.
15. Rafael D. Lins. Cyclic Reference Counting with Lazy Mark-Scan. Information Processing Letters, 44(4):215-220, December 1992.
16. Steven S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers, Inc., San Francisco, CA 94104, USA, 1997.
17. V. Krishna Nandivada and David Detlefs. Compile-Time Concurrent Marking Write Barrier Removal. In Proceedings of the 5th International Symposium on Code Generation and Optimization, pages 37-48. IEEE Computer Society Press, March 2005.
18. Young Gil Park and Benjamin Goldberg. Reference Escape Analysis: Optimizing Reference Counting Based on the Lifetime of References. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, pages 178-189. Association for Computing Machinery, June 1991.
19. Dale E. Rogerson. Inside COM. Microsoft Press, Redmond, WA 98052, USA, 1997.
20. Wolfram Schulte. Deriving Residual Reference Count Garbage Collectors. In Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming, pages 102-116, September 1994.
21. Martin T. Vechev and David F. Bacon. Write Barrier Elision for Concurrent Garbage Collectors. In Proceedings of the 4th International Symposium on Memory Management, pages 13-24. Association for Computing Machinery, October 2004.
22. Joseph Weizenbaum. Symmetric List Processor. Communications of the ACM, 6(9):524-536, September 1963.