Barriers: Friend or foe?

International Symposium on Memory Management, ISMM

Volumn , Issue , 2004, Pages 143-151

  Blackburn, Stephen M ^a   Hosking, Antony L ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b Purdue University   (United States)

Author keywords

Garbage collection; Java; Memory management; Write barriers

Indexed keywords

ALGORITHMS; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM PROCESSORS;

GARBAGE COLLECTION; MEMORY MANAGEMENT; WRITE BARRIERS;

DATA STORAGE EQUIPMENT;

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

References (34)

1. ALPERN, B., ATTANASIO, C. R., BARTON, J. J., COCCHI, A., HUMMEL, S. F., LIEBER, D., NGO, T., MERGEN, M., SHEPHERD, J. C., AND SMITH, S. Implementing Jalapeño in Java. In OOPSLA'99 [22], pp. 314-324.
2. APPEL, A. W. Simple generational garbage collection and fast allocation. Software - Practice and Experience 19, 2 (Feb. 1989), 171-183.
3. ARNOLD, M., FINK, S. J., GROVE, D., HIND, M., AND SWEENEY, P. F. Adaptive optimization in the Jalapeño JVM. In Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (Minneapolis, Minnesota, Oct.). ACM SIGPLAN Notices 35, 10 (Oct. 2000), pp. 47-65.
4. AZAGURY, A., KOLODNER, E. K., PETRANK, E., AND YEHUDAI, Z. Combining card marking with remembered sets: How to save scanning time. In ISMM'98 [19], pp. 10-19.
5. BACON, D. F., CHENG, P., AND RAJAN, V. T. A real-time garbage collector with low overhead and consistent utilization. In Conference Record of the ACM Symposium on Principles of Programming Languages (New Orleans, Lousiana, Jan.). ACM SIGPLAN Notices 38, 1 (Jan. 2003), pp. 285-298.
6. BLACKBURN, S., AND MCKINLEY, K. S. In or out?: Putting write barriers in their place. In Proceedings of the ACM International Symposium on Memory Management (Berlin, Germany, Jun., 2002). ACM SIGPLAN Notices 38, 2 (Feb. 2003), pp. 281-290.
7. BLACKBURN, S., AND MCKINLEY, K. S. Ulterior reference counting: fast garbage collection without a long wait. In OOPSLA'03 [21], pp. 344-358.
8. BLACKBURN, S. M., CHENG, P., AND MCKINLEY, K. S. Myths and reality: The performance impact of garbage collection. In ACM International Conference on Measurement and Modeling of Computer Systems (New York, New York, June). 2004, p. To appear.
9. BLACKBURN, S. M., JONES, R. E., MCKINLEY, K. S., AND Moss, J. E. B. Beltway: Getting around garbage collection gridlock. In Proceedings of the ACM Conference on Programming Language Design and Implementation (Berlin, Germany, June). ACM SIGPLAN Notices 37, 5 (May 2002), pp. 153-164.
10. BRAHNMATH, K., NYSTROM, N., HOSKING, A. L., AND CUTTS, Q. Swizzle barrier optimizations for orthogonal persistence in Java. In Proceedings of the Third International Workshop on Persistence and Java (Tiburon, California, August 1998), R. Morrison, M. Jordan, and M. Atkinson, Eds. Advances in Persistent Object Systems. Morgan Kaufmann, 1999, pp. 268-278.
11. BROOKS, R. A. Trading data space for reduced time and code space in real-time garbage collection on stock hardware. In Proceedings of the ACM Conference on Lisp and Functional Programming (Austin, Texas, Aug.). 1984, pp. 256-262.
12. CAUDILL, P. J., AND WIRFS-BROCK, A. A third generation Smalltalk-80 implementation. In Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (Portland, Oregon, Sept.). ACM SIGPLAN Notices 21, 11 (Nov. 1986), pp. 119-130.
13. HIRZEL, M., DIWAN, A., AND HERTZ, M. Connectivity-based garbage collection. In OOPSLA'03 [21], pp. 359-373.
14. HOSKING, A. L., AND HUDSON, R. L. Remembered sets can also play cards. In Proceedings of the OOPSLA Workshop on Memory Management and Garbage Collection (Washington, DC, Sept.). 1993.
15. HOSKING, A. L., AND MOSS, J. E. B. Protection traps and alternatives for memory management of an object-oriented language. In Proceedings of the ACM Symposium on Operating Systems Principles (Asheville, North Carolina, Dec.). ACM Operating Systems Review 27, 5 (Dec. 1993), pp. 106-119.
16. HOSKING, A. L., MOSS, J. E. B., AND STEFANOVIĆ, D. A comparative performance evaluation of write barrier implementations. In Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (Vancouver, Canada, Oct.). ACM SIGPLAN Notices 27, 10 (Oct. 1992), pp. 92-109.
17. HOSKING, A. L., NYSTROM, N., CUTTS, Q., AND BRAHNMATH, K. Optimizing the read and write barriers for orthogonal persistence. In Proceedings of the Eighth International Workshop on Persistent Object Systems (Tiburon, California, August 1998), R. Morrison, M. Jordan, and M. Atkinson, Eds. Advances in Persistent Object Systems. Morgan Kaufmann, 1999, pp. 149-159.
18. HUDSON, R. L., AND MOSS, J. E. B. Incremental collection of mature objects. In Proceedings of the International Workshop on Memory Management (St. Malo, France, Sept.), Y. Bekkers and J. Cohen, Eds. vol. 637 of Lecture Notes in Computer Science. Springer-Verlag, 1992, pp. 388-403.
19. Proceedings of the ACM International Symposium on Memory Management (Vancouver, Canada, Oct., 1998). ACM SIGPLAN Notices 34, 3 (Mar. 1999).
20. JONES, R., AND LINS, R. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, May 1996. Chapter on distributed collection by Lins.
21. Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (Anaheim, California, Nov.). ACM SIGPLAN Notices 38, 11 (Nov. 2003).
22. Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (Denver, Colorado, Nov.). ACM SIGPLAN Notices 34, 10 (Oct. 1999).
23. PETTERSSON, M. Linux Intel/x86 performance counters, 2003. http://user.it.uu.se/mikpe/linux/perfctr/.
24. ROTH, D. J., AND WISE, D. S. One-bit counts between unique and sticky. In ISMM'98 [19], pp. 49-56.
25. SELIGMANN, J., AND 235-252, S. G. . E. . Incremental mature garbage collection using the Train algorithm. In Proceedings of the European Conference on Object-Oriented Programming (Åarhus, Denmark, Aug.). vol. 952 of Lecture Notes in Computer Science. Springer-Verlag, 1995, pp. 235-252.
26. SOBALVARRO, P. G. A lifetime-based garbage collector for LISP systems on general-purpose computers, 1988. B.S. Thesis, Dept. of EECS, Massachusetts Institute of Technology, Cambridge.
27. SPEC. SPECjvm98 benchmarks, 1998. http://www.spec.org/osg/jvm98.
28. SPEC. SPECjbb2000 benchmarks, 2000. http://www.spec.org/jbb2000.
29. STEFANOVIĆ, D., MCKINLEY, K. S., AND MOSS, J. E. B. Age-based garbage collection. In OOPSLA'99 [22], pp. 370-381.
30. UNGAR, D. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. In Proceedings of the ACM Symposium on Practical Software Development Environments (Pittsburgh, Pennsylvania, Apr.). 1984, pp. 157-167.
31. WILSON, P. R., AND MOHER, T. G. A "card-marking" scheme for controlling intergenerational references in generation-based garbage collection on stock hardware. ACM SIGPLAN Notices 24, 5 (May 1989), 87-92.
32. WILSON, P. R., AND MOHER, T. G. Design of the opportunistic garbage collector. In Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (New Orleans, Louisiana, Oct.). ACM SIGPLAN Notices 24, 10 (Oct. 1989), pp. 23-35.
33. ZEE, K., AND RINARD, M. C. Write barrier removal by static analysis. In Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (Seattle, Washington, Nov.). ACM SIGPLAN Notices 37, 11 (Nov. 2002), pp. 191-210.
34. ZORN, B. Barrier methods for garbage collection. Tech. Rep. CU-CS-494-90, University of Colorado at Boulder, Nov. 1990.