On the configuration of degradable VLSI/WSI arrays

C. Low, H. Leong
{"title":"On the configuration of degradable VLSI/WSI arrays","authors":"C. Low, H. Leong","doi":"10.1109/DFTVS.1993.595639","DOIUrl":null,"url":null,"abstract":"The authors consider the problem of reconfiguring VLSI/WSI arrays via the degradation approach. In this approach, all elements are treated uniformly and no elements are dedicated as spares. The goal is to derive a fault-free subarray T from the defective host array such that the dimensions of T are larger than some specified minimum. This problem has been shown to be NP-complete under various switching and routing constraints. However, it is shown that a special case of the reconfiguration problem with row bypass and column rerouting capabilities, is solvable in polynomial time using network flows. Using this result, a new fast and efficient reconfiguration algorithm is proposed. Empirical study shows that the new algorithm indeed produces good results in terms of the percentages of harvest and degradation of VLSI/WSI arrays.","PeriodicalId":213798,"journal":{"name":"Proceedings of 1993 IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1993 IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DFTVS.1993.595639","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The authors consider the problem of reconfiguring VLSI/WSI arrays via the degradation approach. In this approach, all elements are treated uniformly and no elements are dedicated as spares. The goal is to derive a fault-free subarray T from the defective host array such that the dimensions of T are larger than some specified minimum. This problem has been shown to be NP-complete under various switching and routing constraints. However, it is shown that a special case of the reconfiguration problem with row bypass and column rerouting capabilities, is solvable in polynomial time using network flows. Using this result, a new fast and efficient reconfiguration algorithm is proposed. Empirical study shows that the new algorithm indeed produces good results in terms of the percentages of harvest and degradation of VLSI/WSI arrays.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
可降解VLSI/WSI阵列的结构研究
作者考虑了利用退化方法重构VLSI/WSI阵列的问题。在这种方法中,所有元素都被统一处理,没有任何元素被专用为备用元素。目标是从有缺陷的主机阵列派生出无故障的子阵列T,使得T的维度大于某个指定的最小值。这个问题在各种交换和路由约束下是np完全的。然而,证明了具有行旁路和列重路由能力的重构问题的一个特殊情况,可以在多项式时间内使用网络流来解决。在此基础上,提出了一种新的快速高效的重构算法。实证研究表明,新算法在VLSI/WSI阵列的收获率和退化率方面确实取得了很好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The T9 transputer: A practical example of the application of standard test techniques Fault detection in sequential circuits through functional testing A highly testable 1-out-of-3 CMOS checker System level policies for fault tolerance issues in the FERMI project Topological optimization of PLAs for yield enhancement
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1