【24h】

Robust SAT-Based Search Algorithm for Leakage Power Reduction

机译:鲁棒的基于SAT的漏电降低搜索算法

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

摘要

Leakage current promises to be a major contributor to power dissipation in future technologies. Bounding the maximum and minimum leakage current poses an important problem. Determining the maximum leakage ensures that the chip meets power dissipation constraints. Applying an input pattern that minimizes leakage allows extending battery life when the circuit is in stand-by mode. Finding such vectors can be expressed as a satisfiability problem. We apply in this paper an incremental SAT solver, PBS, to find the minimum or maximum leakage current. The solver is called as a post-process to a random-vector-generation approach. Our results indicate that using a such a generic SAT solver can improve on previously proposed random approaches.
机译:泄漏电流有望成为未来技术功耗的主要贡献者。限制最大和最小泄漏电流是一个重要的问题。确定最大泄漏可确保芯片满足功耗限制。当电路处于待机模式时,采用使泄漏最小的输入模式可以延长电池寿命。找到这样的向量可以表示为可满足性问题。我们在本文中使用增量式SAT解算器PBS来查找最小或最大泄漏电流。求解器称为随机向量生成方法的后处理。我们的结果表明,使用这样的通用SAT解算器可以改进以前提出的随机方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号