Cachetor: Detecting cacheable data to remove bloat

2013 9th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC/FSE 2013 - Proceedings

Volumn , Issue , 2013, Pages 268-278

  Nguyen, Khanh ^a   Xu, Guoqing ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Cacheable data; Dynamic dependence analysis; Performance optimization; Runtime bloat

Indexed keywords

CACHEABLE DATA; DEPENDENCE ANALYSIS; JAVA APPLICATIONS; OBJECT ORIENTED SOFTWARE; PERFORMANCE AND SCALABILITIES; PERFORMANCE OPTIMIZATIONS; RUN-TIME PROFILING; RUNTIMES;

OPTIMIZATION; SCALABILITY; TIME SERIES ANALYSIS;

SOFTWARE ENGINEERING;

EID: 84883686117     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2491411.2491416     Document Type: Conference Paper

References (46)

1. IEEE standard 754 floating-point. http://steve.hollasch.net/cgindex/ coding/ieeefloat.html.
2. The Java Grande benchmark suite. http://www2.epcc.ed.ac.uk/computing/ research-activities/java-grande/index-1.html.
3. Websphere application server development best practices for performance and scalability. http://www-3.ibm.com/software/webservers/appserv/ws- bestpractices.pdf.
4. H. Agrawal and J. R. Horgan. Dynamic program slicing. In PLDI, pages 246-256, 1990.
5. G. Ammons, J.-D. Choi, M. Gupta, and N. Swamy. Finding and removing performance bottlenecks in large systems. In ECOOP, pages 172-196, 2004.
6. T. Ball and J. Larus. Efficient path profiling. In MICRO, pages 46-57, 1996.
7. 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, pages 169-190, 2006.
8. M. D. Bond and K. S. McKinley. Probabilistic calling context. In OOPSLA, pages 97-112, 2007.
9. M. Burtscher and M. Jeeradit. Compressing extended program traces using value predictors. In PACT, pages 159-169, 2003.
10. B. Calder, P. Feller, and A. Eustace. Value profiling. In MICRO, pages 259-269, 1997.
11. T. M. Chilimbi. Efficient representations and abstractions for quantifying and exploiting data reference locality. In PLDI, pages 191-202, 2001.
12. B. Dufour, K. Driesen, L. Hendren, and C. Verbrugge. Dynamic metrics for Java. In OOPSLA, pages 149-168, 2003.
13. B. Dufour, B. G. Ryder, and G. Sevitsky. Blended analysis for performance understanding of framework-based applications. In ISSTA, pages 118-128, 2007.
14. B. Dufour, B. G. Ryder, and G. Sevitsky. A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications. In FSE, pages 59-70, 2008.
15. Q. Jacobson, E. Rotenberg, and J. E. Smith. Path-based next trace prediction. In MICRO, pages 14-23, 1997.
16. Jikes Research Virtual Machine. http://jikesrvm.org.
17. G. Jin, L. Song, X. Shi, J. Scherpelz, and S. Lu. Understanding and detecting real-world performance bugs. In PLDI, pages 77-88, 2012.
18. B. Korel and J. Laski. Dynamic slicing of computer programs. Journal of Systems and Software, 13(3):187-195, 1990.
19. J. Krinke. Advanced Slicing of Sequential and Concurrent Programs. PhD thesis, University of Passau, 2003.
20. J. Larus. Whole program paths. In PLDI, pages 259-269, 1999.
21. M. H. Lipasti and J. P. Shen. Exceeding the dataflow limit via value prediction. In MICRO, pages 226-237, 1996.
22. D. Marinov and R. O'Callahan. Object equality profiling. In OOPSLA, pages 313-325, 2003.
23. A. Milanova, A. Rountev, and B. G. Ryder. Parameterized object sensitivity for points-to analysis for Java. TOSEM, 14(1):1-41, 2005.
24. N. Mitchell and G. Sevitsky. The causes of bloat, the limits of health. OOPSLA, pages 245-260, 2007.
25. N. Mitchell, G. Sevitsky, and H. Srinivasan. Modeling runtime behavior in framework-based applications. In ECOOP, pages 429-451, 2006.
26. A. Nistor, L. Song, D. Marinov, and S. Lu. Toddler: Detecting performance problems via similar memory-access patterns. In ICSE, 2013. to appear.
27. D. Rayside and L. Mendel. Object ownership profiling: A technique for finding and fixing memory leaks. In ASE, pages 194-203, 2007.
28. S. Rubin, R. Bodik, and T. Chilimbi. An efficient profile-analysis framework for data-layout optimizations. In POPL, pages 140-153, 2002.
29. O. Shacham, M. Vechev, and E. Yahav. Chameleon: Adaptive selection of collections. In PLDI, pages 408-418, 2009.
30. A. Shankar, M. Arnold, and R. Bodik. JOLT: Lightweight dynamic analysis and removal of object churn. In OOPSLA, pages 127-142, 2008.
31. K. Srinivas and H. Srinivasan. Summarizing application performance from a component perspective. In FSE, pages 136-145, 2005.
32. F. Tip. A survey of program slicing techniques. Journal of Programming Languages, 3:121-189, 1995.
33. G. Xu. Finding reusable data structures. In OOPSLA, pages 1017-1034, 2012.
34. G. Xu. CoCo: Sound and adaptive replacement of Java collections. In ECOOP, pages 1-26, 2013.
35. G. Xu, M. Arnold, N. Mitchell, A. Rountev, E. Schonberg, and G. Sevitsky. Finding low-utility data structures. In PLDI, pages 174-186, 2010.
36. G. Xu, M. Arnold, N. Mitchell, A. Rountev, and G. Sevitsky. Go with the flow: Profiling copies to find runtime bloat. In PLDI, pages 419-430, 2009.
37. G. Xu and A. Rountev. Detecting inefficiently-used containers to avoid bloat. In PLDI, pages 160-173, 2010.
38. G. Xu, D. Yan, and A. Rountev. Static detection of loop-invariant data structures. In ECOOP, pages 738-763, 2012.
39. J. Yang and R. Gupta. Frequent value locality and its applications. TOPLAS, 1(1):79-105, 2002.
40. X. Zhang, N. Gupta, and R. Gupta. Pruning dynamic slices with confidence. In PLDI, pages 169-180, 2006.
41. X. Zhang and R. Gupta. Cost effective dynamic program slicing. In PLDI, pages 94-106, 2004.
42. X. Zhang and R. Gupta. Whole execution traces. In MICRO, pages 105-116, 2004.
43. X. Zhang, R. Gupta, and Y. Zhang. Precise dynamic slicing algorithms. In ICSE, pages 319-329, 2003.
44. X. Zhang, S. Tallam, and R. Gupta. Dynamic slicing long running programs through execution fast forwarding. In FSE, pages 81-91, 2006.
45. Y. Zhang and R. Gupta. Timestamped whole program path representation and its applications. In PLDI, pages 180-190, 2001.
46. Y. Zhang and R. Gupta. Data compression transformations for dynamically allocated data structures. In CC, pages 14-28, 2002.