• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Requirements for optimal execution of loops with tests
【24h】

Requirements for optimal execution of loops with tests

机译：通过测试优化执行循环的要求

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Both the efficient execution of branch intensive code and knowing the bounds on the same are important issues in computing in general and supercomputing in particular. In prior work, it has been suggested that the hardware needed to execute code with branches optimally is exponentially dependent on the total number of dynamic branches executed, this number of branches being proportional at least to the number of iterations of the loop. For classes of code taking at least one cycle per iteration to execute, this is not the case. For loops containing one test (normally in the form of a Boolean recurrence of order one), it is shown that the hardware necessary varies from exponential to polynomial in the length of the dependence cycle L, while execution time varies from one time cycle per iteration to less than L time cycles per iteration; the variation depends on specific code dependences. These results bring the eager evaluation of imperative code closer to fruition.
机译：分支密集代码的有效执行和了解分支密集代码的界限，这都是通常在计算中，特别是在超级计算中的重要问题。在先前的工作中，已经提出了以最优方式执行具有分支的代码所需的硬件指数地取决于所执行的动态分支的总数，该分支的数目至少与循环的迭代数成比例。对于每次迭代至少需要执行一个周期的代码类，情况并非如此。对于包含一个测试的循环（通常以一阶布尔重现的形式），显示出所需的硬件在依赖循环L的长度上从指数到多项式变化，而执行时间在每次迭代中从一个时间周期变化每次迭代少于L个时间周期；变化取决于特定的代码依赖性。这些结果使对命令代码的热切评估更接近于实现。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号