RealTime-BestPoint-Based compiler optimization algorithm

  • Authors:
  • Jing Wu;Guo-chang Gu

  • Affiliations:
  • College of Computer Science and Technology, Harbin Engineering University, Harbin, China;College of Computer Science and Technology, Harbin Engineering University, Harbin, China

  • Venue:
  • APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Static single assignment (SSA) is a key technique in compiler optimization. Lengauer-Tarjan is a fast algorithm for finding dominators in a flow-graph during the implementation of SSA. There are many useless calls to the recursive function EVAL in Lengauer-Tarjan, and it causes to execute many calls and returns. To solve these problems, an algorithm searching for real-time best-point, which is called RTBP (Real-Time Best-Point), is presented. The criterions related to RTBP are introduced. The causes of capacity differences between RTBP-based Lengauer-Tarjan and EVAL-based Lengauer-Tarjan are comparatively analyzed in theory. Then a static experiment is projected for illustration. Being used in Lengauer-Tarjan, RTBP can save a great deal of runtime and storage space. In a good many circumstances, the Lengauer-Tarjan based on RTBP is more efficient than EVAL-based Lengauer-Tarjan.