首页> 外文OA文献 >Systematic delay-driven power optimisation and power-driven delay optimisation of combinational circuits
【2h】

Systematic delay-driven power optimisation and power-driven delay optimisation of combinational circuits

机译:组合电路的系统延迟驱动功率优化和功率驱动延迟优化

摘要

With the proliferation of mobile wireless communication and embedded systems, the energy efficiency becomes a major design constraint. The dissipated energy is often referred as the product of power dissipation and the input-output delay. Most of electronic design automation techniques focus on optimising only one of these parameters either power or delay. Industry standard design flows integrate systematic methods of optimising either area or timing while for power consumption optimisation one often employs heuristics which are characteristic to a specific design. In this work we answer three questions in our quest to provide a systematic approach to joint power and delay Optimisation. The first question of our research is: How to build a design flow which incorporates academic and industry standard design flows for power optimisation? To address this question, we use a reference design flow provided by Synopsys and integrate in this flow academic tools and methodologies. The proposed design flow is used as a platform for analysing some novel algorithms and methodologies for optimisation in the context of digital circuits. The second question we answer is: Is possible to apply a systematic approach for power optimisation in the context of combinational digital circuits? The starting point is a selection of a suitable data structure which can easily incorporate information about delay, power, area and which then allows optimisation algorithms to be applied. In particular we address the implications of a systematic power optimisation methodologies and the potential degradation of other (often conflicting) parameters such as area or the delay of implementation. Finally, the third question which this thesis attempts to answer is: Is there a systematic approach for multi-objective optimisation of delay and power? A delay-driven power and power-driven delay optimisation is proposed in order to have balanced delay and power values. This implies that each power optimisation step is not only constrained by the decrease in power but also the increase in delay. Similarly, each delay optimisation step is not only governed with the decrease in delay but also the increase in power. The goal is to obtain multi-objective optimisation of digital circuits where the two conflicting objectives are power and delay. The logic synthesis and optimisation methodology is based on AND-Inverter Graphs (AIGs) which represent the functionality of the circuit. The switching activities and arrival times of circuit nodes are annotated onto an AND-Inverter Graph under the zero and a non-zero-delay model. We introduce then several reordering rules which are applied on the AIG nodes to minimise switching power or longest path delay of the circuit at the pre-technology mapping level. The academic Electronic Design Automation (EDA) tool ABC is used for the manipulation of AND-Inverter Graphs. We have implemented various combinatorial optimisation algorithms often used in Electronic Design Automation such as Simulated Annealing and Uniform Cost Search Algorithm. Simulated Annealing (SMA) is a probabilistic meta heuristic for the global optimization problem of locating a good approximation to the global optimum of a given function in a large search space. We used SMA to probabilistically decide between moving from one optimised solution to another such that the dynamic power is optimised under given delay constraints and the delay is optimised under given power constraints. A good approximation to the global optimum solution of energy constraint is obtained. Uniform Cost Search (UCS) is a tree search algorithm used for traversing or searching a weighted tree, tree structure, or graph. We have used Uniform Cost Search Algorithm to search within the AIG network, a specific AIG node order for the reordering rules application. After the reordering rules application, the AIG network is mapped to an AIG netlist using specific library cells. Our approach combines network re-structuring, AIG nodes reordering, dynamic power and longest path delay estimation and optimisation and finally technology mapping to an AIG netlist. A set of MCNC Benchmark circuits and large combinational circuits up to 100,000 gates have been used to validate our methodology. Comparisons for power and delay optimisation are made with the best synthesis scripts used in ABC. Reduction of 23% in power and 15% in delay with minimal overhead is achieved, compared to the best known ABC results. Also, our approach is also implemented on a number of processors with combinational and sequential components and significant savings are achieved.
机译:随着移动无线通信和嵌入式系统的激增,能效成为主要的设计约束。耗散的能量通常称为功耗与输入输出延迟的乘积。大多数电子设计自动化技术都只专注于优化功耗或延迟这些参数之一。工业标准设计流程集成了优化面积或时序的系统方法,而对于功耗优化,通常采用特定设计特有的启发式方法。在这项工作中,我们回答了三个问题,以寻求提供一种系统的方法来实现联合动力和延迟优化。我们研究的第一个问题是:如何建立一个结合了学术和行业标准设计流程的设计流程以实现功耗优化?为了解决这个问题,我们使用了Synopsys提供的参考设计流程,并将其集成到该流程的学术工具和方法中。所提出的设计流程被用作分析数字电路环境中一些用于优化的新颖算法和方法的平台。我们回答的第二个问题是:是否可以在组合数字电路的背景下采用系统方法进行功率优化?起点是选择合适的数据结构,该数据结构可以轻松合并有关延迟,功率,面积的信息,然后可以应用优化算法。特别是,我们要解决系统电源优化方法的含义以及其他(通常是相互冲突的)参数(例如面积或实施延迟)的潜在降级问题。最后,本文试图回答的第三个问题是:是否存在一种系统的方法来进行延迟和功率的多目标优化?为了具有平衡的延迟和功率值,提出了延迟驱动的功率和功率驱动的延迟优化。这意味着每个功率优化步骤不仅受到功率降低的限制,而且还受到延迟增加的限制。同样,每个延迟优化步骤不仅取决于延迟的减少,还取决于功率的增加。目标是获得数字电路的多目标优化,其中两个冲突的目标是功率和延迟。逻辑综合和优化方法基于表示电路功能的AND反相器图(AIG)。在零和非零延迟模型下,将电路节点的开关活动和到达时间标注在AND-反相器图上。然后,我们介绍一些重排序规则,这些规则适用于AIG节点,以在技术前映射级别上最大程度地降低电路的开关功率或最长路径延迟。学术的电子设计自动化(EDA)工具ABC用于“与”反相器图的操作。我们已经实现了电子设计自动化中经常使用的各种组合优化算法,例如模拟退火和均匀成本搜索算法。模拟退火(SMA)是针对全局优化问题的概率元启发式算法,该问题是在较大的搜索空间中找到给定函数的全局最优值的良好近似。我们使用SMA概率性地决定了从一种优化解决方案过渡到另一种解决方案,以便在给定的延迟约束下优化动态功率,并在给定的功率约束下优化延迟。获得了能量约束的全局最优解的良好近似。统一成本搜索(UCS)是一种树搜索算法,用于遍历或搜索加权树,树结构或图形。我们已经使用统一成本搜索算法在AIG网络内进行搜索,AIG网络是用于重新排序规则应用程序的特定AIG节点订单。重新排序规则应用后,将使用特定的库单元将AIG网络映射到AIG网表。我们的方法结合了网络重组,AIG节点重新排序,动态功率和最长路径延迟估计与优化,以及最终将技术映射到AIG网表。一组MCNC基准电路和多达100,000个门的大型组合电路已用于验证我们的方法。使用ABC中使用的最佳综合脚本对功率和延迟优化进行了比较。与最著名的ABC结果相比,功率降低了23%,延迟降低了15%。此外,我们的方法还可以在具有组合和顺序组件的许多处理器上实施,并且可以节省大量资金。

著录项

  • 作者

    Mehrotra Rashmi;

  • 作者单位
  • 年度 2013
  • 总页数
  • 原文格式 PDF
  • 正文语种 en
  • 中图分类

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号