Accurate, efficient, and adaptive calling context profiling

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn 2006, Issue , 2006, Pages 263-271

  Zhuang, Xiaotong ^a   Serrano, Mauricio J ^b   Cain, Harold W ^b   Choi, Jong Deok ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Adaptive; Call Graph; Calling Context; Calling Context Tree; Java Virtual Machine; Profiling

Indexed keywords

ADAPTIVE; CALL GRAPH; CALLING CONTEXT; CALLING CONTEXT TREE; JAVA VIRTUAL MACHINE; PROFILING;

ADAPTIVE SYSTEMS; OPTIMIZATION; REDUNDANCY; TREES (MATHEMATICS);

COMPUTER PROGRAMMING;

EID: 33746100320     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1133255.1134012     Document Type: Conference Paper

References (26)

1. Colorado bench, http://www-plan.cs.colorado.edu/henkel/projects/colorado_bench.
2. Kawa, the Java-based scheme system. http://www.gnu.org/software/kawa.
3. G. Ammons, T. Ball, and J. R. Larus. Exploiting hardware performance counters with flow and context sensitive profiling. In SIGPLAN Conference on Programming Language Design and Implementation, pages 85-96, 1997.
4. M. Arnold and D. Grove. Collecting and Exploiting High-Accuracy Call Graph Profiles in Virtual Machines. In International Symposium on Code Generation and Optimization, 2005.
5. M. Arnold and B. Ryder. A framework for reducing the cost of instrumented code. In SIGPLAN Conference on Programming Language Design and Implementation, pages 168-179, 2001.
6. M. Arnold and P. F. Sweeney. Approximating the calling context tree via sampling. IBM Research Report, July 2000.
7. T. Ball and J. R. Larus. Optimally profiling and tracing programs. ACM Transactions on Programming Languages and Systems, 16(4): 1319-1360, July 1994.
8. A. R. Bernat and B. P. Miller. Incremental call-path profiling. Technical report, University of Wisconsin, 2004.
9. P. P. Chang, S. A. Mahlke, W. Y. Chen, and W.M. Hwu. Profiled-guided automatic inline expansion fore programs. Software-Practice and Experience, 22(5):349-369, 1992.
10. T. H. Cormen, C. E. Leiserson, and R. L. Rivesl. Introduction to Algorithms. MIT Press, Cambridge MA and McGraw-Hill, 1990.
11. Standard Performance Evaluation Corporation. Specjbb2000 Java business benchmark. http://www.spec.org/jbb2000.
12. Standard Performance Evaluation Corporation. Specjvm98 benchmarks. http://www.spec.org/jvm98.
13. Standard Performance Evaluation Corporation. SPECjAppServer2004. http://www.spec.org/jAppServer2004.
14. P. T. Feller. Value profiling for instructions and memory locations. Masters Thesis CS98-581, University of California San Diego, April 1998.
15. N. Froyd, J. Mellor-Crummey, and R. Fowler. Low-overhead call path profiling of unmodified, optimized code. In ICS '05: Proceedings of the 19th annual international conference on Supercomputing, pages 81-90, 2005.
16. D. Grove, G. DeFouw, J. Dean, and C. Chambers. Call graph construction in object-oriented languages. In Proceedings OOPSLA '97, pages 108-124, 1997.
17. N. Grcevski, A. Kielstra, K. Stoodley, M. Stoodley, and V. Sundaresan. Java just-in-time compiler and virtual machine improvements for server and middleware applications. In Usenix 3rd Virtual Machine Research and Technology Symposium (VM'04), 2004.
18. R. J. Hall. Call path profiling. In Proceedings of the 14th International Conference on Software Engineering, IEEE Computer Society 1992.
19. K. Hazelwood and D. Grove. Adaptive Online Context Sensitive Inlining. In International Symposium on Code Generation and Optimization, pages 253-264, 2003.
20. M. Hirzel and T. Chilimbi. Bursty tracing: A framework for low-overhead temporal profiling. In In 4th ACM Workshop on Feedback-Directed and Dynamic Optimization (FDDO-4), December 2001.
21. U. Holzle and D. Ungar. Optimizing dynamically-dispatched calls with run-time type feedback. In SIGPLAN Conference on Programming Language Design and Implementation, pages 326-336, 1994.
22. P. Kessler S. Graham and M. McKusick. An execution profiler for modular programs. Software-Practice and Experience, 13(8):671-685, 1983.
23. J. M. Spivey. Fast, accurate call graph proliling. Software-Practice and Experience, 34(3):249-264, 2004.
24. T. Suganuma, T. Yasue, and T. Nakatani. An empirical study of method inlining for a Java just-in-time compiler. In JVM-02 Java Virtual Machine Research and Technology Symposium, pages 91-104, 2002.
25. J. Whaley. A portable sampling-based profiler for Java virtual machines. In Java Grande, pages 78-87, 2000.
26. T. Yasue, T. Suganuma, H. Komatsu, and T. Nakatani. An efficient online path profiling framework for Java just-in-time compilers. In PACT Conference on Parallel Architectures and Compilation Techniques, pages 148-158, 2003.