Difference: ReadingGroupNotes (7 vs. 8)

Revision 82008-02-22 - ChenDing

Line: 1 to 1
META TOPICPARENT name="ReadingGroup"
  • Use profiling to find candidates, where a loop index variable has a constant value and the loop can be completely unrolled and optimized at run time, by considering the benefit and cost.
  • Use pointer analysis to identify all checking points to ensure the correctness of the specialized code. At run time, a code cache is used when generating the unrolled code.
  • Tested on benchmarks, including mk88sim, that seem to have many loops of small iteration counts. A factor of 4 speedup.


  • Adaptive techniques for enabling and disabling the speculation of a PPR. Observed 86% prediction accuracy and 162% reduction in computation cost. PPR is coarse grain, which allows efficient use of software solutions. The predictor has four parameters: decay, quota, aggressiveness, gain threshold.
  • Compare Calling Graph (CG), Calling Tree (CT) and Calling Context Tree (CCT) to show the advantages of CCT.
  • Use a stochastical way to build CCT adaptively with low overhead and good enough accuracy.
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2017 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding URCS? Send feedback