首页> 外文会议>IEEE International Symposium on the Physical Failure Analysis of Integrated Circuits >Divide and conquer algorithm for parallel reconfiguration of VLSI array with faults
【24h】

Divide and conquer algorithm for parallel reconfiguration of VLSI array with faults

机译:分割和征服算法,以便与故障进行平行重新配置VLSI数组

获取原文

摘要

Although many reconfiguration strategies for fault tolerance on VLSI arrays have been proposed in the last two decades, few works on parallel reconfiguration have been reported. This paper presents an algorithm based on divide and conquer strategy for parallel reconfiguration VLSI arrays in the presence of faulty processing elements (PEs). The proposed algorithm splits the original host array into many sub-arrays in a recursive way, then target arrays are formed on each sub-arrays in parallel using a previous algorithm named GCR. The final target array is achieved by merging all these target arrays constructed on each sub-arrays. Experimental results show that the reconfiguration is significantly accelerated in comparison with previous algorithm GCR.
机译:虽然在过去二十年中提出了许多对VLSI阵列的容错的重新配置策略,但已经报告了很少有关于并行重新配置的工作。本文在存在故障处理元件(PES)的情况下,介绍了一种基于分割和征服并行重新配置VLSI阵列策略的算法。该算法以递归方式将原始主机阵列分成许多子阵列,然后使用名为GCR的先前算法并行地在每个子阵列上形成目标阵列。通过合并在每个子阵列上构造的所有这些目标阵列来实现最终目标阵列。实验结果表明,与先前的算法GCR相比,重新配置明显加速。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号