首页> 外文OA文献 >History-based Schemes and Implicit Path Enumeration
【2h】

History-based Schemes and Implicit Path Enumeration

机译:基于历史的计划和隐式路径枚举

摘要

The Implicit Path Enumeration Technique is often used to compute the WCET of control-intensive programs. This method does not consider execution paths as ordered sequences of basic blocks but instead as lists of basic blocks with their respective execution counts. This way of describing an execution path is adequate to compute its execution time, provided that safe individual WCETs for the blocks are known. Recently, a model for branch prediction has been integrated into WCET computation with IPET. This model generates safe estimations of the branch misprediction counts. However, we show in this paper that these counts can be over-estimated because IPET does consider simplified flow information that do not completely reflect the program semantics. We show how additional information on nested loops can be specified so that the model provides tighter WCET estimations.
机译:隐式路径枚举技术通常用于计算控制密集型程序的WCET。此方法不将执行路径视为基本块的有序序列,而是视为具有各自执行计数的基本块列表。只要知道块的安全单个WCET,这种描述执行路径的方式就足以计算其执行时间。最近,用于分支预测的模型已通过IPET集成到WCET计算中。该模型生成分支错误预测计数的安全估计。但是,我们在本文中表明,由于IPET确实考虑了不能完全反映程序语义的简化流信息,因此可以高估这些计数。我们展示了如何指定有关嵌套循环的其他信息,以便该模型提供更严格的WCET估计。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号