Exploiting trivial and redundant computation
Exploiting trivial and redundant computation
复制标题
利用琐碎和冗余的计算
DOI：
--
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
Stephen Richardson
中科院分区：
文献类型：
--
作者：
Stephen Richardson
讨论了平凡计算的概念，其中简单操作数的出现使潜在的复杂操作变得简单。一个简单的例子是整数除法，除数是2；除法变成了简单的移位操作。还讨论了冗余计算的概念，冗余计算是指某些操作由于重复看到相同的操作数而重复执行相同的函数。在两个独立的基准测试套件（SPEC基准测试和Perfect Club）上进行的实验发现了大量琐碎和冗余的操作。利用这些知识来提高计算效率的各种体系结构方法包括检测琐碎操作数和结果缓存。进一步的实验表明，在三种不同风格的机器架构上，这些技术有显著的加速效果
The notion of trivial computation, in which the appearance of simple operands renders potentially complex operations simple, is discussed. An example of a trivial operation is integer division, where the divisor is two; the division becomes a simple shift operation. The concept of redundant computation, in which some operation repeatedly does the same function because it repeatedly sees the same operands, is also discussed. Experiments on two separate benchmark suites, the SPEC benchmarks and the Perfect Club, find a surprising amount of trivial and redundant operation. Various architectural means of exploiting this knowledge to improve computational efficiency include detection of trivial operands and the result cache. Further experimentation shows significant speedup from these techniques, as measured on three different styles of machine architecture.<<ETX>>