首页> 外文会议> >Disjoint eager execution: an optimal form of speculative execution
【24h】

Disjoint eager execution: an optimal form of speculative execution

机译:不相交的渴望执行:投机执行的最佳形式

获取原文

摘要

Instruction Level Parallelism (ILP) speedups of an order-of-magnitude or greater may be possible using the techniques described herein. Traditional speculative code execution is the execution of code down one path of a branch (branch prediction) or both paths of a branch (eager execution), before the condition of the branch has been evaluated, thereby executing code ahead of time, and improving performance. A third, optimal, method of speculative execution, Disjoint Eager Execution (DEE), is described herein. A restricted form of DEE, easier to implement than pure DEE, is developed and evaluated. An implementation of both DEE and minimal control dependencies is described. DEE is shown both theoretically and experimentally to yield more parallelism than both branch prediction and eager execution when the same, finite, execution resources are assumed. ILP speedups of factors in the ten's are demonstrated with constrained resources.
机译:使用本文描述的技术,数量级或更高数量级的指令级并行化(ILP)加速可能是可能的。传统的推测性代码执行是在评估分支条件之前,沿着分支的一个路径(分支预测)或分支的两个路径(渴望执行)执行代码,从而提前执行代码并提高性能。本文描述了第三种最优的推测执行方法,即不相交的渴望执行(DEE)。开发和评估了受限制的DEE形式,它比纯DEE更易于实现。描述了DEE和最小控制依赖项的实现。在假定相同,有限的执行资源的情况下,DEE在理论上和实验上均比分支预测和渴望执行产生了更多的并行性。有限的资源证明了ILP加快了十个因素。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号