首页> 外文会议>World Multiconference on Systemics, Cybernetics and Informatics(SCI 2001) v.7: Computer Science and Engineering pt.1; 20010722-20010725; Orlando,FL; US >A Fast Method for Determining an Efficient Bound on the Optimal Solution of the Cost-to-Time Ratio Problem
【24h】

A Fast Method for Determining an Efficient Bound on the Optimal Solution of the Cost-to-Time Ratio Problem

机译:一种确定时空比问题最优解的有效界限的快速方法

获取原文
获取原文并翻译 | 示例

摘要

The cost-to-time ratio problem has numerous applications. For instance, algorithms for solving this problem have been used to compute optimal clock period of synchronous circuits and the iteration period bound of cyclic data flow graphs. Some excellent algorithms for solving this problem require a bound to start their execution. Choosing a good bound may significantly decrease their execution time. This paper presents a fast method for determining an efficient bound on the optimal solution of this problem. The method has been implemented and tested on ISCAS89 benchmark circuits. By using the obtained bounds, experimental results show that the best algorithms we have implemented for solving this problem have been substantially accelerated.
机译:成本时间比率问题有许多应用。例如,用于解决此问题的算法已用于计算同步电路的最佳时钟周期和循环数据流图的迭代周期边界。一些解决该问题的优秀算法需要一定的约束才能开始执行。选择一个好的界限可能会大大减少它们的执行时间。本文提出了一种快速方法,用于确定此问题的最佳解决方案的有效边界。该方法已在ISCAS89基准电路上实现和测试。通过使用获得的边界,实验结果表明,我们为解决该问题而实施的最佳算法已得到实质性加速。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号