lospre in linear time
lospre in linear time
复制标题
以线性时间开始
DOI:
10.1145/3493229.3493304
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Philipp K. Krause
中科院分区:
文献类型:
--
作者:
Philipp K. Krause
Lifetime-optimal speculative partial redundancy elimination (lospre) is the most advanced currently known redundancy elimination technique. It subsumes many previous approaches, such as common subexpression elimination, global common subexpression elimination, and loop-invariant code motion. Previously known lospre algorithms have high time complexity; faster but less powerful approaches have been used and developed further instead. We present a simple linear-time algorithm for lospre for structured programs that can also handle some more general scenarios compared to previous approaches. We prove that our approach is optimal and that the runtime is linear in the number of nodes in the control-flow graph. The condition on programs of being structured is true for many programming languages and for others, such as C, is equivalent to a bound on the number of goto labels per function. An implementation in a mainstream C compiler demonstrates the practical feasibility of our approach, which is based on graph-structure theory and uses tree-decompositions. For structured programs, we also improve the runtime bound of deterministic implementations of the previously known MC-PRE and MC-SSAPRE algorithms from O(n3) to O(n2.5).
登录
查看更多内容
DOI:
10.1093/comjnl/19.1.43
发表时间:
1976
期刊:
Comput. J.
影响因子:
--
作者:
H. Curnow;B. Wichmann
通讯作者:
H. Curnow;B. Wichmann
DOI:
--
发表时间:
1998
期刊:
ACM-SIAM Symposium on Discrete Algorithms
影响因子:
--
作者:
H. Bodlaender;J. Gustedt;J. A. Telle
通讯作者:
J. A. Telle
DOI:
--
发表时间:
2011
期刊:
影响因子:
--
作者:
Julie Zelenski
通讯作者:
Julie Zelenski
DOI:
--
发表时间:
2004
期刊:
SIGP
影响因子:
--
作者:
Rastislav Bodík;R. Gupta;M. Soffa
通讯作者:
M. Soffa
影响因子:
1
作者:
COURCELLE, B
通讯作者:
COURCELLE, B