Dynamic removal of redundant computations
Dynamic removal of redundant computations
复制标题
动态去除冗余计算
DOI：
--
复制
发表时间：
1999
期刊：
影响因子：
--
通讯作者：
Jordi Tubella
中科院分区：
文献类型：
--
作者：
Carlos Molina;Antonio González;Jordi Tubella
提出了一种动态指导级重复使用的机制，提出了一个基本概念，即机理利用是冗余计算的运行时间去除，尤其是消除了常见的子表达和不变性。删除冗余计算是优化编译器的目标，但由于对数据的了解有限，有时它们不会成功。此外：提出的机制还可以去除准冗余的计算，例如通常产生相同结果但有时它们分解的子表达：取决于数据值，因此编译器无法消除它们：Spec9.5的实验结果表明该机制平均可以避免执行约32％的动态说明，并在超级量表微处理器中提供1.10加速：对D@Erent Conjgurations和与以前的方案进行了比较，以及PET $ ECT重用引擎的PE $ ORMANCE潜力。
A mechanism for dynamic instruction-level reuse in superscalar microprocessors is presented, The underlying concept that the mechanism exploits is the run-time removal of redundant computations, and in particular the elimination of common subexpressions and invariants. Removing redundant computation is a target of optimizing compilers but sometimes they do not succeed due to their limited knowledge of the data. Moreover: the proposed mechanism can also remove quasi-redundant computations, such as subexpressions that often produce the same result but sometimes they diffeer: depending on the data values, and thus they cannot be eliminated by the compiler: Experimental results for the Spec9.5 show that on average the mechanism can avoid the execution of about 32% of the dynamic instructions and provides an 1.10 speedup in a superscalar microprocessor: An extensive evaluation of d@erent conjgurations and a comparison with previous schemes are presented, as well as the pe$ormance potential of a pet$ect reuse engine.