Advanced compiler design and implementation
Advanced compiler design and implementation
A new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
SIAM Journal on Computing
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modern Compiler Implementation in Java
Modern Compiler Implementation in Java
Algorithms for computing the static single assignment form
Journal of the ACM (JACM)
An Efficient Algorithm for the Creation of Single Assignment Forms
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
Hi-index | 0.00 |
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.