CRAMM: Virtual memory support for garbage-collected applications

OSDI 2006 - 7th USENIX Symposium on Operating Systems Design and Implementation

Volumn , Issue , 2006, Pages 103-116

  Yang, Ting ^a   Berger, Emery D ^a   Kaplan, Scott F ^b   Moss, J B Eliot ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b AMHERST COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

REFUSE COLLECTION; SYSTEMS ANALYSIS;

AUTOMATIC MEMORY MANAGEMENT; GARBAGE COLLECTION; GARBAGE COLLECTION ALGORITHM; JAVA VIRTUAL MACHINES; MEMORY PRESSURE; PERFORMANCE DEGRADATION; REFERENCE BEHAVIORS; VIRTUAL MEMORY SYSTEMS;

RANDOM ACCESS STORAGE;

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

References (29)

1. G. Almasi, C. Cascaval, and D. A. Padua. Calculating stack distances efficiently. In ACM SIGPLAN Workshop on Memory System Performance, pages 37–43, Berlin, Germany, Oct. 2002.
2. R. Alonso and A. W. Appel. An advisor for flexible working sets. In Proceedings of the 1990 SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 153–162, Boulder, CO, May 1990.
3. B. Alpern, C. R. Attanasio, J. J. Barton, M. G. Burke, P. Cheng, J.-D. Choi, A. Cocchi, S. J. Fink, D. Grove, M. Hind, S. F. Hummel, D. Lieber, V. Litvinov, M. F. Mergen, T. Ngo, V. Sarkar, M. J. Serrano, J. C. Shepherd, S. E. Smith, V. C. Sreedhar, H. Srinivasan, and J. Whaley. The Jalepeño virtual machine. IBM Systems Journal, 39(1):211–238, Feb. 2000.
4. A. Appel. Simple generational garbage collection and fast allocation. Software: Practice and Experience, 19(2):171–183, Feb. 1989.
5. O. Babaoglu and D. Ferrari. Two-level replacement decisions in paging stores. IEEE Transactions on Computers, C-32(12):1151–1159, Dec. 1983.
6. H. G. Baker. The Treadmill: Real-time garbage collection without motion sickness. ACM SIGPLAN Notices, 27(3):66–70, March 1992.
7. BEA WebLogic. Technical white paper JRockit: Java for the enterprise. http://www.bea.com/content/news events /white papers/BEA JRockit wp.pdf.
8. B. T. Bennett and V. J. Kruskal. LRU stack processing. IBM Journal of R & D, 19(4):353–357, 1975.
9. S. M. Blackburn, P. Cheng, and K. S. McKinley. Oil and Water? High Performance Garbage Collection in Java with MMTk. In 26th International Conference on Software Engineering, pages 137–146, May 2004.
10. S. M. Blackburn, R. Garner, C. Hoffman, A. M. Khan, K. S. McKinley, R. Bentzur, A. Diwan, D. Feinberg, D. Frampton, S. Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J. E. B. Moss, A. Phansalkar, D. Stefanović, T. VanDrunen, D. von Dincklage, and B. Wiedermann. The DaCapo benchmarks: Java benchmarking development and analysis. In OOPSLA’06: Proceedings of the 21st annual ACM SIGPLAN conference on Object-Oriented Programing, Systems, Languages, and Applications, New York, NY, USA, Oct. 2006. ACM Press.
11. T. Brecht, E. Arjomandi, C. Li, and H. Pham. Controlling garbage collection and heap growth to reduce the execution time of Java applications. In Proceedings of the 2001 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications, pages 353–366, Tampa, FL, June 2001.
12. R. W. Carr and J. L. Henessey. WSClock – a simple and effective algorithm for virtual memory management. In Proceedings of the Eighth ACM Symposium on Operating Systems Principles (SOSP), pages 87–95, Dec. 1981.
13. W. W. Chu and H. Opderbeck. The page fault frequency replacement algorithm. In AFIPS Conference Proceedings, volume 41(1), pages 597–609, Montvale, NJ, 1972. AFIPS Press.
14. E. Cooper, S. Nettles, and I. Subramanian. Improving the performance of SML garbage collection using application-specific virtual memory management. In Conference Record of the 1992 ACM Symposium on Lisp and Functional Programming, pages 43–52, San Francisco, CA, June 1992.
15. P. J. Denning. The working set model for program behavior. In Proceedings of the ACM Symposium on Operating System Principles, pages 15.1–15.12, Jan. 1967.
16. P. J. Denning. Working sets past and present. IEEE Transactions on Software Engineering, SE-6(1):64–84, Jan. 1980.
17. C. Ding and Y. Zhong. Predicting whole-program locality through reuse distance analysis. In ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, pages 245–257, San Diego, CA, June 2003.
18. M. Hertz, Y. Feng, and E. D. Berger. Garbage collection without paging. In Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementaton, pages 143–153, Chicago, IL, June 2005.
19. JavaSoft. J2SE 1.5.0 documentation: Garbage collector ergonomics. http://java.sun.com/j2se/1.5.0/docs/guide/vm/gc-ergonomics.html.
20. S. F. Kaplan, L. A. McGeoch, and M. F. Cole. Adaptive caching for demand prepaging. In Proceedings of the 2002 International Symposium on Memory Management, pages 114–126, June 2002.
21. Y. H. Kim, M. D. Hill, and D. A. Wood. Implementing stack simulation for highly-associative memories. In Proceedings of the 1991 SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 212–213, San Diego, CA, 1991.
22. R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger. Evaluation techniques for storage hierarchies. IBM Systems Journal, 9(2):78–117, 1970.
23. F. Olken. Efficient methods for calculating the success function of fixed space replacement policies. Technical Report LBL-12370, Lawrence Berkeley Laboratory, 1981.
24. R. H. Patterson, G. A. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka. Informed prefetching and caching. In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles, pages 79–95, New York, NY, USA, 1995. ACM Press.
25. Y. Smaragdakis, S. F. Kaplan, and P. R. Wilson. The EELRU adaptive replacement algorithm. Performance Evaluation, 53(2):93–123, July 2003.
26. R. A. Sugumar and S. G. Abraham. Efficient simulation of caches under optimal replacement with applications to miss characterization. In Measurement and Modeling of Computer Systems, pages 24–35, Santa Clara, CA, 1993.
27. P. R. Wilson, S. F. Kaplan, and Y. Smaragdakis. The case for compressed caching in virtual memory systems. In Proceedings of The 1999 USENIX Annual Technical Conference, pages 101–116, Monterey, California, June 1999. USENIX Association.
28. T. Yang, M. Hertz, E. D. Berger, S. F. Kaplan, and J. E. B. Moss. Automatic heap sizing: Taking real memory into account. In Proceedings of the ACM SIGPLAN International Symposium on Memory Management, pages 61–72, Vancouver, Canada, Oct. 2004.
29. P. Zhou, V. Pandy, J. Sundaresan, A. Raghuraman, Y. Zhou, and S. Kumar. Dynamic tracking of page miss ratio curves for memory management. In Proceedings of the 11th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 177–188, Boston, MA, Oct. 2004.