Compiler optimizations for nondeferred reference-counting garbage collection

International Symposium on Memory Management, ISMM

Volumn 2006, Issue , 2006, Pages 150-161

  Joisha, Pramod G ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Reference counting; Static analyses

Indexed keywords

COSTS; OPTIMIZATION; STATIC ANALYSIS;

COMPILER OPTIMIZATIONS; GARBAGE COLLECTION; REFERENCE COUNTING; TRACING COLLECTORS;

PROGRAM COMPILERS;

EID: 34247187435     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1133956.1133976     Document Type: Conference Paper

References (32)

1. Association for Computing Machinery. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, June 2000.
2. David F. Bacon, Clement R. Attanasio, Han B. Lee, V. T. Rajan, and Stephen Smith. Java without the Coffee Breaks: A Nonintrusive Multiprocessor Garbage Collector. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 92-103. Association for Computing Machinery, June 2001.
3. David F. Bacon and V. T. Rajan. Concurrent Cycle Collection in Reference Counted Systems, In. Proceedings of the 15th European Conference on Object-Oriented Programming, volume 2072 of Lecture Notes in Computer Science, pages 207-235. Springer-Verlag, June 2001.
4. Henry G. Baker. Minimizing Reference Count Updating with Deferred and Anchored Pointers for Functional Data Structures. ACM SIGPLAN Notices, 29(9):38-43, September 1994.
5. Jeffrey M. Barth. Shifting Garbage Collection Overhead to Compile Time. Communications of the ACM. 20(7):513-518, July 1977.
6. Stephen M. Blackburn and Kathryn S. McKinley. Ulterior Reference Counting: Fast Garbage Collection without a Long Wait. In Proceedings of the 18th ACM SIGPLAN Conference on ObjectOriented Programming, Systems, Languages, and Applications, pages 344-358, October 2003.
7. Don Box and Chris Sells. Essential .NET: The Common Language Runtime. Addison-Wesley Publishing Company, Inc., Redwood City, CA 94065, USA, 2003.
8. George E. Collins. A Method for Overlapping and Erasure of Lists. Communications of the ACM, 3(12):655-657, December 1960.
9. Keith D. Cooper and L. Taylor Simpson. Live Range Splitting in a Graph Coloring Register Allocator. In Proceedings of the 7th International Conference on Compiler Construction, volume 1383 of Lecture Notes in Computer Science, pages 174-187. Springer-Verlag, March 1998.
10. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. The MIT Press, Cambridge. MA 02142, USA, 1995.
11. John DeTreville. Experience with Concurrent Garbage Collectors for Modula-2+. Technical Report SRC-RR-64, Digital Systems Research Center. November 1990.
12. Alain Deutsch. On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications. In Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 157-168. Association for Computing Machinery, January 1990.
13. L. Peter Deutsch and Daniel G. Bobrow. An Efficient, Incremental Automatic Garbage Collector. Communications of the ACM. 19(9):522-526. September 1976.
14. H. Gelernter, J. R. Hansen, and C. L. Gerbcrich. A FORTRAN-Compiled List-Processing Language. Journal of the ACM, 7(2):87101, April 1960.
15. Sanjay Ghemawat, Keith H. Randall, and Daniel J. Scales. Field Analysis: Getting LIseful and Low-Cost Interprocedural Information. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation [1], pages 334 344.
16. Paul Hudak. A Semantic Model of Reference Counting and its Abstraction (Detailed Summary). In Proceedings of the ACM Conference on LISP and Functional Programming, pages 351-363. Association for Computing Machineiy, April 1986.
17. Richard Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, Inc., New York City. NY 10158. USA. 1996.
18. Yossi Levanoni and Erez Petrank. An On-the-fly Reference Counting Garbage Collector for Java. In Proceedings of the 16th ACM SIGPIAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 367-380, October 2001.
19. Rafael D. Lins. Cyclic Reference Counting with Lazy Mark-Scan. Information Processing Letters, 44(4):215-220, December 1992.
20. Steven S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers, Inc., San Francisco, CA 94104, USA, 1997.
21. V. Krishna Nandivada and David Detlefs. Compile-Time Conclurent 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.
22. Young Oil 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 178189. Association for Computing Machineiy. June 1991.
23. Hard Paz, Erez Petrank, David F. Bacon, Elliot K. Kolodner, and V. T. Rajan. An Efficient On-the-Fly Cycle Collection, In. Proceedings of the 14th International Conference on Compiler Construction, volume 3443 of Lecture Notes in Computer Science, pages 156-171. Springer-Verlag, April 2005.
24. Benjamin C. Pierce. Types and Programming Languages. The MIT Press, Cambridge, MA 02142, USA, 2002.
25. Dale E. Rogerson. Inside COM. Microsoft Press, Redmond, WA 98052, USA, 1997.
26. Paul Rovner. On Adding Garbage Collection and Runtime Types to a Strongly-Typed, Statically-Checked, Concurrent Language. Technical Report CSL-84-7, Xerox Palo Alto Research Center, July 1985.
27. Erik Ruf. Effective Synchronization Removal for Java. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation [1], pages 208-218.
28. 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.
29. Wolfram Schulte and Wolfgang Grieskamp. Generating Efficient Portable Code for a Strict Applicative Language. In Proceedings of the PHOENIX Seminar and Workshop on Declarative Programming, pages 239-252, November 1991.
30. Chris Sells and Christopher Tavares. Adding Reference Counting to the Shared Source Common Language Infrastructure. At http://www.sellsbrothers.com/ writing.
31. 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.
32. Joseph Weizenbaum. Symmetric List Processor. Communications of the ACM, 6(9):524-536, September 1963.