Compile-time concurrent marking write barrier removal

Proceedings of the 2005 International Symposium on Code Generation and Optimization, CGO 2005

Volumn 2005, Issue , 2005, Pages 37-48

  Krishna Nandivada, V ^a   Detlefs, David ^b  

^a Engineering IV   (United States)

^b SUN MICROSYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; GARBAGE COLLECTORS; TIME CONSTRAINTS; WRITE BARRIERS;

CODES (SYMBOLS); COMPUTATIONAL METHODS; CONSTRAINT THEORY; OPTIMIZATION; REFUSE DISPOSAL; TIME DOMAIN ANALYSIS;

PROGRAM COMPILERS;

EID: 33646847145     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass., 1986.
2. Hezi Azatchi, Yossi Levanoni, Harel Paz, and Erez Petrank. An on-the-fly mark and sweep garbage collector based on Sliding views. In OOPSLA'03 ACM Conference on Object-Oriented Systems, Languages and Applications, Anaheim, CA, November 2003.
3. David F. Bacon, Perry Cheng, and V. T. Rajan. A real-time garbage collector with low overhead and consistent utilization. In Conference Record of the Thirtieth Annual ACM Symposium on Principles of Programming Languages, ACM SIGPLAN Notices, New Orleans, LA, January 2003.
4. Jeffrey M. Barth. Shifting garbage collection overhead to compile time. Communications of the ACM, 20(7):513-518, July 1977.
5. BEA. Bea weblogic jrockit. the Server JVM. URL. http://www.bea.com/ products/weblogic/server/jrockit_wp_052303_final.pdf.
6. Hans-J. Boehm, Alan J. Demers, and Scott Shenker. Mostly parallel garbage collection. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 157-164, Toronto, ON, Canada, June 1991. ACM Press.
7. David R. Chase, Mark Wegman, and F. Kenneth Zadeck. Analysis of pointers and structures. In Proceedings of the Conference on Programming Language Design and Implementation, pages 296-310, 1990.
8. Jong-Deok Choi, M. Gupta, Maurice Serrano, Vugranam C. Sreedhar, and Sam Midkiff. Escape analysis for Java. In OOPSLA'99 ACM Conference on Object-Oriented Systems, Languages and Applications, volume 34(10) of ACM SIGPLAN Notices, pages 1-19, Denver, CO, October 1999. ACM Press.
9. James C. Corbett. Using shape analysis to reduce finite-state models of concurrent Java programs. ACM Trans. Softw. Eng. Methodol, 9(1):51-93, 2000.
10. David Detlefs, Christine Flood, Steven Heller, and Tony Printezis. Garbage-first garbage collection. In Proceedings of the 2004 International Symposium on Memory Management. ACM Press, 2004.
11. Michael P. Gerlek, Eric Stoltz, and Michael Wolfe. Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form. ACM Transactions on Programming Languages and Systems, 17(1):85-122, January 1995.
12. Urs Hölzle. A fast write barrier for generational garbage collectors. In Eliot Moss, Paul R. Wilson, and Benjamin Zorn, editors, OOPSLA/ECOOP '93 Workshop on Garbage Collection in Object-Oriented Systems, October 1993.
13. Antony L. Hosking, Nathaniel Nystrom, Quintin Cutts, and Kumar Brahnmath. Optimizing the read and write barrier for orthogonal persistence. In Proceedings of the Eighth International Workshop on Persistent Object Systems, Tiburon, CA, August 1998.
14. Neil D. Jones and Steven S. Muchnick. Flow analysis and optimization of lisp-like structures. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981.
15. Priyadarshan Kolte and Michael Wolfe. Elimination of redundant array subscript range checks. In Proceedings of the Conference on Programming Language Design and Implementation, pages 270-278, 1995.
16. V. Krishna Nandivada and David Detlefs. Compile-time concurrent marking write barrier removal. Technical Report SML TR-2004-142, Sun Microsystems Laboratories, December 2004.
17. Yoav Ossia, Ori Ben-Yitzhak, Irit Goft, Elliot K. Kolodner, Victor Leikehman, and Avi Owshanko. A parallel, incremental and concurrent gc for servers. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pages 129-140. ACM Press, 2002.
18. Tony Printezis and David Detlefs. A generational mostly-concurrent garbage collector. In Proceedings of the International Symposium on Memory Management, Minneapolis, Minnesota, October 15-19, 2000.
19. Radu Rugina and Martin C. Rinard. Symbolic bounds analysis of pointers, array indices, and accessed memory regions. In Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation (PLDI00), volume 35.5 of ACM Sigplan Notices, pages 182-195, N.Y., June 18-21 2000. ACM Press.
20. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems, 20(1): 1-50, January 1998.
21. Yefim Shuf, Manish Gupta, Rajesh Bordawekar, and Jaswinder Pal Singh. Exploiting prolific types for memory management and optimizations. In Conference Record of the Twenty-ninth Annual ACM Symposium on Principles of Programming Languages, ACM SIGPLAN Notices. ACM Press, January 2002.
22. 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. ACM Press, 2004.
23. John Whaley and Martin Rinard. Compositional pointer and escape analysis for Java programs. In OOPSLA'99 ACM Conference on Object-Oriented Systems, Languages and Applications, volume 34(10) of ACM SIGPLAN Notices, pages 187-206, Denver, CO, October 1999. ACM Press.
24. Taichi Yuasa. Real-time garbage collection on general-purpose machines. Journal of Software and Systems, 11(3):181-198, 1990.
25. Karen Zee and Martin Rinard. Write barrier removal by static analysis. In Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, pages 191-210. ACM Press, 2002.