Finding reusable data structures

Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA

Volumn , Issue , 2012, Pages 1017-1033

  Xu, Guoqing ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Data structure encoding; Memory management; Object reuse; Performance optimization

Indexed keywords

ALLOCATION SITES; DATA CONTENTS; DATA VALUES; MEMORY MANAGEMENT; OBJECT ORIENTED; OBJECT REUSE; PERFORMANCE GAIN; PERFORMANCE IMPROVEMENTS; PERFORMANCE OPTIMIZATIONS; PERFORMANCE PROBLEMS; RUNTIMES;

COMPUTER PROGRAMMING LANGUAGES; OBJECT ORIENTED PROGRAMMING; REUSABILITY;

DATA STRUCTURES;

EID: 84869837624     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2384616.2384690     Document Type: Conference Paper

References (50)

1. E. E. Aftandilian and S. Z. Guyer. GC assertions: Using the garbage collector to check heap properties. In ACMSIGPLAN Conference on Programming Language Design and Imple- mentation (PLDI), pages 235-244, 2009.
2. H. Agrawal and J. R. Horgan. Dynamic program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 246-256, 1990.
3. E. Altman, M. Arnold, S. Fink, and N. Mitchell. Performance analysis of idle programs. In ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Lan- guages, and Applications (OOPSLA), pages 739-753, 2010.
4. M. Arnold, M. Vechev, and E. Yahav. QVM: An efficient runtime for detecting defects in deployed systems. In ACM SIGPLAN International Conference on Object-Oriented Pro- gramming, Systems, Languages, and Applications (OOPSLA), pages 143-162, 2008.
5. D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman, and S. S. Rao. Representing trees of higher degree. Algorith- mica, 43:275-292, 2005.
6. S. Bhattacharya, M. Nanda, K. Gopinath, and M. Gupta. Reuse, recycle to de-bloat software. In European Conference on Object-Oriented Programming (ECOOP), pages 408-432, 2011.
7. S. M. Blackburn and K. S. McKinley. Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 22-32, 2008.
8. 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. Stefanovíc, T. VanDrunen, D. von Dincklage, and B. Wiedermann. The DaCapo benchmarks: Java benchmarking development and analysis. In ACM SIGPLAN International Conference on Object-Oriented Pro-gramming, Systems, Languages, and Applications (OOPSLA), pages 169-190, 2006.
9. B. Blanchet. Escape analysis for object-oriented languages. Applications to Java. In ACMSIGPLAN International Confer- ence on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 20-34, 1999.
10. M. D. Bond and K. S. McKinley. Bell: Bit-encoding online memory leak detection. In International Conference on Archi- tectural Support for Programming Languages and Operating Systems (ASPLOS), pages 61-72, 2006.
11. M. D. Bond and K. S. McKinley. Probabilistic calling context. In ACM SIGPLAN International Conference on Object- Oriented Programming, Systems, Languages, and Applica- tions (OOPSLA), pages 97-112, 2007.
12. B. Calder, P. Feller, and A. Eustace. Value profiling. In In- ternational Symposium on Microarchitecture (MICRO), pages 259-269, 1997.
13. A. E. Chis, N. Mitchell, E. Schonberg, G. Sevitsky, P. O'Sullivan, T. Parsons, and J. Murphy. Patterns of memory inefficiency. In European Conference on Object-Oriented Programming (ECOOP), pages 383-407, 2011.
14. J. Choi, M. Gupta, M. Serrano, V. Sreedhar, and S. Midkiff. Escape analysis for Java. In ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Lan- guages, and Applications (OOPSLA), pages 1-19, 1999.
15. B. Dufour, B. G. Ryder, and G. Sevitsky. A scalable technique for characterizing the usage of temporaries in frameworkintensive Java applications. In ACM SIGSOFT Interna- tional Symposium on the Foundations of Software Engineer- ing (FSE), pages 59-70, 2008.
16. D. Gay and B. Steensgaard. Fast escape analysis and stack allocation for object-based programs. In International Con- ference on Compiler Construction (CC), LNCS 1781, pages 82-93, 2000.
17. R. F. Geary, R. Raman, and V. Raman. Succinct ordinal trees with level-ancestor queries. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1-10, 2004.
18. O. Gheorghioiu, A. Salcianu, and M. Rinard. Interprocedural compatibility analysis for static object preallocation. In ACM SIGPLAN-SIGACT Symposium on Principles of Pro- gramming Languages (POPL), pages 273-284, 2003.
19. M. Hertz, S.M. Blackburn, J. E. B.Moss, K. S.McKinley, and D. Stefanovíc. Generating object lifetime traces with Merlin. ACM Transactions on Programming Languages and Systems, 28(3):476-516, 2006.
20. J. Jansson, K. Sadakane, and W.-K. Sung. Ultra-succinct representation of ordered trees. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 575-584, 2007.
21. R. E. Jones and C. Ryder. A study of Java object demographics. In International Symposium on Memory Management (ISMM), pages 121-130, 2008.
22. M. Jump and K. S. McKinley. Cork: Dynamic memory leak detection for garbage-collected languages. In ACMSIGPLAN- SIGACT Symposium on Principles of Programming Lan- guages (POPL), pages 31-38, 2007.
23. D. Marinov and R. O'Callahan. Object equality profiling. In ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOP- SLA), pages 313-325, 2003.
24. N. Mitchell. The runtime structure of object ownership. In European Conference on Object-Oriented Programming (ECOOP), pages 74-98, 2006.
25. N. Mitchell and G. Sevitsky. The causes of bloat, the limits of health. ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Ap- plications (OOPSLA), pages 245-260, 2007.
26. N.Mitchell, G. Sevitsky, and H. Srinivasan. Modeling runtime behavior in framework-based applications. In European Con- ference on Object-Oriented Programming (ECOOP), pages 429-451, 2006.
27. N. Mitchell, E. Schonberg, and G. Sevitsky. Making sense of large heaps. In European Conference on Object-Oriented Programming (ECOOP), pages 77-97, 2009.
28. N. Mitchell, E. Schonberg, and G. Sevitsky. Four trends leading to Java runtime bloat. IEEE Software, 27(1):56-63, 2010.
29. J. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In IEEE Sym- posium on Foundations of Computer Science (FOCS), pages 118-126, 1997.
30. J. I.Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAMJ. Comput., 31(3):762-776, 2001.
31. C. Reichenbach, N. Immerman, Y. Smaragdakis, E. Aftandilian, and S. Z. Guyer. What can the GC compute efficiently? A language for heap assertions at GC time. In ACM SIGPLAN International Conference on Object-Oriented Pro- gramming, Systems, Languages, and Applications (OOPSLA), pages 256-269, 2010.
32. C. Ruggieri and T. P. Murtagh. Lifetime analysis of dynamically allocated objects. In ACM SIGPLAN-SIGACT Sym- posium on Principles of Programming Languages (POPL), pages 285-293, 1988.
33. J. B. Sartor, M. Hirzel, and K. S. McKinley. No bit left behind: the limits of heap data compression. In International Symposium on Memory Management (ISMM), pages 111- 120, 2008.
34. J. B. Sartor, S. M. Blackburn, D. Frampton, M. Hirzel, and K. S. McKinley. Z-rays: divide arrays and conquer speed and flexibility. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 471- 482, 2010.
35. O. Shacham, M. Vechev, and E. Yahav. Chameleon: Adaptive selection of collections. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 408-418, 2009.
36. A. Shankar, M. Arnold, and R. Bodik. JOLT: Lightweight dynamic analysis and removal of object churn. In ACM SIGPLAN International Conference on Object-Oriented Pro- gramming, Systems, Languages, and Applications (OOPSLA), pages 127-142, 2008.
37. M. Vechev, E. Yahav, and G. Yorsh. PHALANX: Parallel checking of expressive heap assertions. In International Sym- posium on Memory Management (ISMM), pages 41-50, 2010.
38. J. Whaley and M. Rinard. Compositional pointer and escape analysis for Java programs. In ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Lan- guages, and Applications (OOPSLA), pages 187-206, 1999.
39. G. Xu. Analyzing Large-Scale Object-Oriented Software to Find and Remove Runtime Bloat. PhD thesis, The Ohio State University, 2011.
40. G. Xu and A. Rountev. Precisememory leak detection for Java software using container profiling. In International Confer- ence on Software Engineering (ICSE), pages 151-160, 2008.
41. G. Xu and A. Rountev. Detecting inefficiently-used containers to avoid bloat. In ACM SIGPLAN Conference on Program- ming Language Design and Implementation (PLDI), pages 160-173, 2010.
42. G. Xu, M. Arnold, N. Mitchell, A. Rountev, and G. Sevitsky. Go with the flow: Profiling copies to find runtime bloat. In ACM SIGPLAN Conference on Programming Language De- sign and Implementation (PLDI), pages 419-430, 2009.
43. G. Xu, M. Arnold, N. Mitchell, A. Rountev, E. Schonberg, and G. Sevitsky. Finding low-utility data structures. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 174-186, 2010.
44. G. Xu, N. Mitchell, M. Arnold, A. Rountev, and G. Sevitsky. Software bloat analysis: Finding, removing, and preventing performance problems in modern large-scale object-oriented applications. In FSE/SDP Working Conference on the Future of Software Engineering Research (FoSER), pages 421-426, 2010.
45. G. Xu, M. D. Bond, F. Qin, and A. Rountev. Leakchaser: Helping programmers narrow down causes of memory leaks. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 270-282, 2011.
46. G. Xu, D. Yan, and A. Rountev. Static detection of loopinvariant data structures. In European Conference on Object- Oriented Programming (ECOOP), pages 738-763, 2012.
47. D. Yan, G. Xu, and A. Rountev. Uncovering performance problems in Java applications with reference propagation profiling. In International Conference on Software Engineering (ICSE), pages 134-144, 2012.
48. X. Zhang. Fault Localization via Precise Dynamic Slicing. PhD thesis, University of Arizona, 2006.
49. X. Zhang and R. Gupta. Cost effective dynamic program slicing. In ACM SIGPLAN Conference on Programming Lan- guage Design and Implementation (PLDI), pages 94-106, 2004.
50. X. Zhang, R. Gupta, and Y. Zhang. Precise dynamic slicing algorithms. In International Conference on Software Engi- neering (ICSE), pages 319-329, 2003.