Program Analysis

• Hybrid Analysis and its Application to Automatic Parallelization
  Static and dynamic analysis of memory reference patterns.
• How it works
  • Aggregation and classification of memory references
  • Formulation of dependence equations
  • Extraction of predicates from dependence equations
  • Code generation
• Complex example
• Speedup on benchmark applications
• Compilation report on benchmark applications

Dynamic Optimization

• Speculative Run-time Optimization
• LRPD Overhead Reduction Techniques for reducing run-time analysis overhead.
• Speculative Parallelization of Partially Parallel Loops A recursive LRPD test with reduced overhead.
• Adaptive Reduction Parallelization A decision scheme for choosing the best reduction technique based on run-time access pattern.