Structural path profiling: An efficient online path profiling framework for just-in-time compilers

Journal of Instruction-Level Parallelism

Volumn 6, Issue , 2004, Pages

  Yasue, Toshiaki ^a   Suganuma, Toshio ^a   Komatsu, Hideaki ^a   Nakatani, Toshio ^a  

^a IBM RESEARCH TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAM LISTINGS; ITERATIVE METHODS; JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; PROGRAM COMPILERS;

JUST-IN-TIME (JIT) COMPILERS; PATH PROFILING; TARGET PROGRAMS;

ONLINE SYSTEMS;

EID: 2942726232     PISSN: None     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (27)

1. M. Arnold, M. Hind, and B. G. Ryder, "Online Feedback-Directed Optimization of Java," in In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications, pp. 111-129, 2002.
2. M. Paleczny, C. Vick, and C. Click, "The Java HotSpot Server Compiler," in Proceedings of the Java Virtual Machine Research and Technology Symposium, pp. 1-12, 2001.
3. T. Suganuma, T. Yasue, M. Kawahito, H. Komatsu, and T. Nakatani, "A Dynamic Optimization Framework for a Java Just-In-Time Compiler," in Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications, pp. 180-194, 2001.
4. M. Kawahito, H. Komatsu, and T. Nakatani, "Eliminating Exception Checks and Partial Redundancies for Java Just-in-Time Compilers," Tech. Rep. RT0350, IBM Research Report, 2000.
5. G. Ammons and J. R. Larus, "Improving Data-flow Analysis with Path Profiles," in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 72-84, 1998.
6. C. Young and M. D. Smith, "Static Correlated Branch Prediction," ACM Transactions on Programming Languages and Systems, vol. 21, no. 5, pp. 1028-1075, 1999.
7. R. Bodik, R. Gupta, and M. L. Soffa, "Complete Removal of Redundant Expressions," in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 1-14, 1998.
8. R. Gupta, D. A. Berson, and J. Z. Fang, "Path Profile Guided Partial Dead Code Elimination Using Predication," in Proceedings of the Conference on Parallel Architectures and Compilation Techniques, pp. 102-113, 1997.
9. R. Gupta, D. A. Berson, and J. Z. Fang, "Path Profile Guided Partial Redundancy Elimination Using Speculation," in Proceedings of the IEEE International Conference on Computer Languages, pp. 230-239, 1998.
10. C. Young and M. D. Smith, "Better Global Scheduling Using Path Profiles," in Proceedings of 31st International Conference on Microarchitecture, pp. 115-123, 1998.
11. T. Ball and J. R. Larus, "Efficient Path Profiling," in Proceedings of 29th International Conference on Microarchitecture, pp. 46-57, 1996.
12. P. T. Feller, "Value profiling for instructions and memory locations," Master's thesis, University of California, San Diego, 1998.
13. M. Arnold and B. G. Ryder, "A Framework for Reducing the Cost of Instrumented Code," in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 168-179, 2001.
14. T. Ball, P. Mataga, and M. Sagiv, "Edge Profiling versus Path Profiling: The Show-down," in Proceedings of the 25th ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages, pp. 134-148, 1998.
15. R. Cohn and P. G. Lowney, "Feedback directed optimization in Compaq's compilation tools for Alpha," in Proceedings of 2nd ACM Workshop on Feedback-Directed Optimization, 1999.
16. J. Fisher, "Trace Scheduling: A Technique for Global Microcode Compaction," IEEE Transactions on Computers, vol. C-30, no. 7, pp. 478-490, 1981.
17. W. Hwu, S. A. Mahlke, W. Y. Chen, P. P. Chang, N. J. Warter, R. A. Bringmann, R. G. Ouellette, R. E. Hank, T. Kiyohara, G. E. Haab, J. G. Holm, and D. M. Lavery, "The Superblock: An Effective Technique for VLIW and Superscalar Compilation," Journal of Supercomputing, vol. 7, no. (1,2), pp. 229-248, 1993.
18. O. Traub, S. Schechter, and M. D. Smith, "Ephemeral Instrumentation for Lightweight Program Profiling," tech. rep., Harvard University, 1999.
19. P. Havlak, "Nesting of Reducible and Irreducible Loops," ACM Transactions on Programming Languages and Systems, vol. 19, no. 4, pp. 557-567, 1997.
20. J. K. Hollingsworth, B. P. Miller, M. R. Goncalves, O. Naim, Z. Xu, and L. Zheng, "MDL: A Language and Compiler for Dynamic Program Instrumentation," in Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, pp. 201-212, 1997.
21. K. Pettis and R. C. Hansen, "Profile Guided Code Positioning," in Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, pp. 6-27, 1990.
22. Standard Performance Evaluation Corporation. SPECjvm98 and SPECjbb2000. available http://www.spec.org/.
23. D. W. Wall, "Predicting program behavior using real or estimated profiles," in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 59-70, 1991.
24. T. M. Chilimbi and M. Hirzel, "Dynamic Hot Data Stream Prefetching for General-Purpose Program," in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 199-209, 2002.
25. C.G. Nevill-Manning and I. H. Witten, "Linear-time, incremental hierarchy inference for compression," in Proceedings of the Data Compression Conference, pp. 3-11, 1997.
26. V. Bala, E. Duesterwald, and S. Banerjia, "Dynamo: A Transparent Dynamic Optimization System," in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 1-12, 2000.
27. E. Duesterwald and V. Bala, "Software Profiling for Hot Path Prediction: Less is More," in Proceedings of the 9th International Conference on Architectural Support on Programming Languages and Operating Systems, pp. 202-211, 2000.