Partial method compilation using dynamic profile information

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

Volumn 36, Issue , 2001, Pages 166-179

  Whaley, John ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA FLOW ANALYSIS; DYNAMIC PROGRAMMING; JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; PROGRAM INTERPRETERS; TIME SHARING PROGRAMS;

DYNAMIC PROFILE INFORMATION; PARTIAL DEAD CODE ELIMINATION; PARTIAL METHOD COMPILATION; RARE PATH SENSITIVE ESCAPE ANALYSIS; RARE PATH SENSITIVE POINTER ANALYSIS;

PROGRAM COMPILERS;

EID: 0035551808     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/504311.504295     Document Type: Conference Paper

References (46)

1. Improving data-flow analysis with path profiles
2. FLEX compiler infrastructure
3. Adaptive optimization in the Jalapeño JVM
4. A comparative study of static and dynamic heuristics for inlining
5. Dynamo: A transparent dynamic optimization system
6. Optimally profiling and tracing programs
7. Efficient path profiling
8. Exploring optimal compilation unit shapes for an embedded just-in-time compiler
9. The Jalapeño dynamic optimizing compiler for Java
10. Scalar replacement in the presence of conditional control flow
11. Making pure object-oriented languages practical
12. The effect of code expanding optimizations of instruction cache design
13. IMPACT: An architectural framework for multiple instruction issue processors
14. Improving instruction locality with just-in-time code layout
15. Practicing JUDO: Java under dynamic optimizations
16. Byte code engineering library
17. Delayed exceptions - Speculative execution of trapping instructions
18. Trace scheduling: A technique for global microcode compaction
19. Optimizing java programs in the presence of exceptions
20. Resource-sensitive profile-directed data flow analysis for code optimization
21. Region-based compilation: An introduction and motivation
22. Qualified data flow problems
23. Partial redundancy elimination driven by a cost benefit analysis
24. The superblock: An effective technique for VLIW and superscalar compilation
25. A study of devirtualization techniques for a Java just-in-time compiler
26. Design, implementation, and evaluation of optimizations in a just-in-time compiler
27. Effective null pointer check elimination utilizing hardware traps
28. A survey of data flow analysis techniques
29. Partial dead code elimination
30. Orbit: An optimising compiler for scheme
31. The multiflow trace scheduling compiler
32. Sentinel scheduling: A model for compiler-controlled speculative execution
33. A study of exception handling and its dynamic optimization in java
34. The Java HotSpot(TM) server compiler
35. Profile guided code positioning. SIGPLAN notices
36. Path splitting: A technique for improving data flow analysis
37. Boosting beyond static scheduling in a superscalar processor
38. Overview of the IBM Java just-in-time compiler
39. A dynamic optimization framework for java just-in-time compiler
40. Compositional pointer and escape analysis for Java programs