首页> 外文会议>1999 IEEE/ACM international conference on computer-aided design : Digest of technical papers >Efficient Incremental Rerouting for Fault Reconfiguration in Field Programmable Gate Arrays
【24h】

Efficient Incremental Rerouting for Fault Reconfiguration in Field Programmable Gate Arrays

机译:在现场可编程门阵列中进行故障重配置的有效增量重路由

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

摘要

The ability to reconfigue around manufacturing defects and operational faults increases FPGA chip yield, reduces system downtime and maintenance in field operation, and increases reliabilities of mission- and life-critical systems. The fault reconfiguration technique discussed in this work use the principle of node covering in which reconfiguration is achieved by constructing replacement chains of cells from faulty cells to spare/unused ones. A key issue in such reconfiguration is efficient incremental rerouting in the FPGA. Previous methods for node-covering based reconfiguration are "static" in the sense that extra interconnects are added a-priori as part of the initial circuit routing so that a specific fault pattern (e.g., one fault per row) can be tolerated [1]. This, however, results in worst-case track overheads and also in an inflexibility to tolerate other realistic fault patterns. In this paper, we develop dynamic reconfiguration and incremental rerouting techniques that are fault specific. In this approach, the FPGA is initially routed without any extra interconnects for reconfiguration. When faults occur, the routed nets have to be minimally perturbed to allow these interconnects to be inserted "on-the-fly" for reconfiguration. These requirements are addressed in our minimally incremental rerouting technique Conv_T-DAG, which uses a cost-directed depth-first search strategy. We prove several results that establishes the near-optimality of Conv_T-DAG in terms of track overhead. T the best of our knowledge, this is the first time that an incremental rerouting technique has been developed for FPGAs. For several benchmark circuits, the static approach to tolerating one fault per row resulted in a 43precent to 34precent track overhead. Using the dynamic reconfiguration approach and Conv_T-DAG results in an average overhead of only 16precent-an improvement of more than 50precent. Over all circuits, the reconfiguration time per fault ranges from 16.8 to 72.9 secs. Simulation of smaller fault sets of one to four faults show very small track overheads ranging from 1.75precent to 4.49precent. Conv_T-DAG can also be used for interconnect fault tolerance.
机译:能够围绕制造缺陷和操作故障进行重新配置的功能提高了FPGA芯片的产量,减少了系统停机时间和现场操作维护,并提高了任务和生命攸关系统的可靠性。在这项工作中讨论的故障重配置技术使用节点覆盖的原理,其中通过构建从故障单元到备用/未使用单元的单元替换链来实现重新配置。这种重新配置的关键问题是FPGA中高效的增量式重新路由。先前的基于节点覆盖的重新配置方法是“静态的”,在这种意义上,额外的互连是作为初始电路路由的一部分先验添加的,因此可以容忍特定的故障模式(例如,每行一个故障)[1] 。然而,这导致最坏情况下的轨道开销,并且还导致不能忍受其他实际故障模式。在本文中,我们开发了特定于故障的动态重配置和增量重路由技术。采用这种方法,FPGA最初的布线无需任何额外的互连即可进行重新配置。当出现故障时,必须最小化路由网络的干扰,以允许“即时”插入这些互连以进行重新配置。我们的最小增量重路由技术Conv_T-DAG满足了这些要求,该技术使用了成本导向的深度优先搜索策略。我们证明了一些结果,这些结果建立了Conv_T-DAG在磁道开销方面的接近最佳性。据我们所知,这是首次为FPGA开发增量重路由技术。对于几个基准电路,容忍每行一个故障的静态方法导致轨道开销为43%至34%。使用动态重新配置方法和Conv_T-DAG导致平均开销仅为16%-改善了50%以上。在所有电路上,每个故障的重新配置时间范围为16.8至72.9秒。对一到四个故障的较小故障集的仿真显示,跟踪开销很小,范围为1.75%至4.49%。 Conv_T-DAG也可以用于互连容错。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号