Scholarlink

Self-restructuring schemes for \(N\times N\) Arrays with N spares on single side and diagonal as spare arrangements are described. Restructuring is done by either direct replacement (DR) or single-track-shift (STS) for the spare arrangements. A restructuring algorithm for the case that faulty PEs are replaced with spares on diagonal by DR is characterized and given as a matching problem in graph theory. For the replacement by STS, a restructuring algorithm satisfying the given repairability condition is shown. A logical circuit to execute each algorithm to be proposed is described. The survival rates and array reliabilities are shown to evaluate the effectiveness of the algorithms.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Two Dimensional Arrays (2D Arrays) with N Spares

  • 章节

  • 发表日期：

    2025年

查看全文
  • Itsuo Takanami

摘要

Self-restructuring schemes for \(N\times N\) Arrays with N spares on single side and diagonal as spare arrangements are described. Restructuring is done by either direct replacement (DR) or single-track-shift (STS) for the spare arrangements. A restructuring algorithm for the case that faulty PEs are replaced with spares on diagonal by DR is characterized and given as a matching problem in graph theory. For the replacement by STS, a restructuring algorithm satisfying the given repairability condition is shown. A logical circuit to execute each algorithm to be proposed is described. The survival rates and array reliabilities are shown to evaluate the effectiveness of the algorithms.