• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference in Advances in Electrical and Computer Technologies >A Supplement to 'PRE: A Simple, Pragmatic, and Provably Correct Algorithm'
【24h】

A Supplement to 'PRE: A Simple, Pragmatic, and Provably Correct Algorithm'

机译：补充'pre：简单，务实，可证明的正确算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A partial redundancy elimination (PRE) is a compiler optimization that eliminates expressions that are redundant on some but not necessarily all paths through a program. A PRE algorithm called "PRE: a simple, pragmatic, and provably correct algorithm," presented by Vineeth Kumar Paleri does not give importance for eliminating edge splitting, even though the edge splitting is more expensive than inserting a computation at an existing node of a data flow graph (DFG). The insert equation of the PRE algorithm does not insert a computation for an expression in an existing node of a DFG if the node does not compute the expression concerned. This leads to unnecessary edge splitting. In this paper, the insert equation of the PRE algorithm is updated to avoid the edge splitting as far as possible, and hence the algorithm becomes more compact and beautiful.
机译：部分冗余消除（pre）是一个编译器优化，消除了一些在某些情况下冗余的表达式，但不一定是通过程序的所有路径。由Vineeth Kumar Paleri呈现的预算法称为“pre：简单，务实，且可算法的算法”并不能重视消除边缘拆分，即使边缘分离比在现有节点处插入计算更昂贵数据流图（DFG）。如果节点不计算有关的表达式，则预算法的插入式方程不会在DFG的现有节点中插入用于表达式的计算。这导致不必要的边缘分裂。在本文中，更新了预算法的插入式方程，以避免边缘分离，因此算法变得更加紧凑和美观。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号