Write barrier removal by static analysis

ACM SIGPLAN Notices

Volumn 37, Issue 11, 2012, Pages 191-210

  Zee, Karen ^a   Rinard, Martin ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Generational garbage collection; Pointer analysis; Program analysis; Write barriers

Indexed keywords

BENCHMARKING; REFUSE COLLECTION;

BENCHMARK PROGRAMS; GARBAGE COLLECTION; MEMORY MANAGEMENT; OBJECT ALLOCATION; POINTER ANALYSIS; PROGRAM ANALYSIS; STATIC PROGRAM ANALYSIS; WRITE BARRIERS;

STATIC ANALYSIS;

EID: 85062220020     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/583854.582439     Document Type: Article

References (36)

1. Andrew W. Appel. Simple generational garbage collection and fast allocation. Software-Practice & Experience, 19(2):171-183, 1989.
2. Andrew W. Appel and Kai Li. Virtual memory primitives for user programs. In Proceedings of the 4th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 96-107, 1991.
3. J. E. Barnes and P. Hut. A hierarchical O(N log N) force-calculation algorithm. Nature, 324(4):446-449, 1986.
4. Jon Louis Bentley. A parallel algorithm for constructing minimum spanning trees. Journal of Algorithms, 1(1):51-59, 1980.
5. Gianfranco Bilardi and Alexandru Nicolau. Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines. SIAM Journal on Computing, 18(2):216-228, 1989.
6. Bruno Blanchet. Escape analysis for object-oriented languages: Application to Java. In Proceedings of the 14th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 20-34, 1999.
7. Jeff Bogda and Urs Hölzle. Removing unnecessary synchronization in Java. In Proceedings of the 14th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 35-46, 1999.
8. Chandrasekhar Boyapati and Martin C. Rinard. A parameterized type system for race-free Java programs. In Proceedings of the 16th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 56-69, 2001.
9. Brendon Cahoon and Kathryn S. McKinley. Data flow analysis for software prefetching linked data structures in Java. In Proceedings of the 10th International Conference on Parallel Architectures and Compilation Techniques, pages 280-291, 2001.
10. Martin C. Carlisle and Anne Rogers. Software caching and computation migration in Olden. In Proceedings of the 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 29-38, 1995.
11. Craig Chambers. The Design and Implementation of the Self Compiler, an Optimizing Compiler for Object-Oriented Languages. PhD thesis, Stanford University, 1992.
12. Jong-Deok Choi, Manish Gupta, Mauricio J. Serrano, Vugranam C. Sreedhar, and Samuel P. Midkiff. Escape analysis for Java. In Proceedings of the 14th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 1-19, 1999.
13. Brian Cook. Four garbage collectors for Oberon. Undergraduate thesis, Princeton University, 1989.
14. D. Culler, A. Dusseau, S. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, and K. Yelick. Parallel programming in Split-C. In Proceedings of the ACM/IEEE Supercomputing Conference, pages 262-273, 1993.
15. Julian Dolby and Andrew A. Chien. An automatic object inlining optimization and its evaluation. In Proceedings of the ACM SIGPLAN'00 Conference on Programming Language Design and Implementation, pages 345-357, 2000.
16. Tamar Domani, Elliot K. Kolodner, and Erez Petrank. A generational on-the-fly garbage collector for Java. In Proceedings of the ACM SIGPLAN'00 Conference on Programming Language Design and Implementation, pages 274-284, 2000.
17. L. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transactions on Graphics, 4(2):74-123, 1985.
18. Urs Hölzle. A fast write barrier for generational garbage collectors. In OOPSLA'93 Workshop on Garbage Collection and Memory Management, 1993.
19. Antony Hosking, Nathaniel Nystrom, Quintin Cutts, and Kumar Brahnmath. Optimizing the read and write barriers for orthogonal persistence. In Proceedings of the 8th International Workshop on Persistent Object Systems, pages 149-159, 1998.
20. Antony L. Hosking and Richard L. Hudson. Remembered sets can also play cards. In OOPSLA'93 Workshop on Garbage Collection and Memory Management, 1993.
21. Antony L. Hosking, J. Eliot B. Moss, and Darko Stefanović. A comparative performance evaluation of write barrier implementations. In Proceedings of the 6th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 92-109, 1992.
22. Richard Hudson and J. Eliot B. Moss. Incremental collection of mature objects. In Proceedings of the International Workshop on Memory Management, pages 388-403, 1992.
23. Richard Jones and Rafael Lins. Garbage Collection Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, 1996.
24. Richard M. Karp. Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Mathematics of Operations Research, 2(3):209-224, 1977.
25. Butler W. Lampson. Hints for computer system design. Operating Systems Review, 15(5):33-48, 1983.
26. G. Lomow, J. Cleary, B. Unger, and D. West. A performance study of Time Warp. In Proceedings of the SCS Multiconference on Distributed Simulation, pages 50-55, 1988.
27. S. Lumetta, L. Murphy, X. Li, D. Culler, and I. Khalil. Decentralized optimal power pricing: The development of a parallel program. In Proceedings of the ACM/IEEE Supercomputing Conference, pages 240-249, 1993.
28. Erik Ruf. Effective synchronization removal for Java. In Proceedings of the ACM SIGPLAN'00 Conference on Programming Language Design and Implementation, pages 208-218, 2000.
29. Hanan Samet. Computing perimeters of regions in images represented by quadtrees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1981.
30. Robert A. Shaw. Improving garbage collector performance in virtual memory. Technical Report CSL-TR-87-323, Stanford University, 1987.
31. Yefim Shuf, Manish Gupta, Rajesh Bordawekar, and Jaswinder Pal Singh. Exploiting prolific types for memory management and optimizations. In Proceedings of the 29th Annual ACM Symposium on the Principles of Programming Languages, pages 295-306, 2002.
32. Mads Tofte and Jean-Pierre Talpin. Region-based memory management. Information and Computation, 132(2):109-176, 1997.
33. David Ungar. Generational scavenging: A non-disruptive high performance storage reclamation algorithm. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pages 157-167, 1984.
34. J. Whaley and M. Rinard. Compositional pointer and escape analysis for Java programs. In Proceedings of the 14th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 187-206, 1999.
35. Benjamin Zorn. Comparative Performance Evaluation of Garbage Collection Algorithms. PhD thesis, University of California at Berkeley, November 1989.
36. Benjamin Zorn. Barrier methods for garbage collection. Technical Report CU-CS-494-90, University of Colorado, 1990.