为产量而设计:高水平合成的容错方法

M. Broglia, G. Buonanno, M. Sami, M. Selvini
{"title":"为产量而设计:高水平合成的容错方法","authors":"M. Broglia, G. Buonanno, M. Sami, M. Selvini","doi":"10.1109/DFTVS.1998.732180","DOIUrl":null,"url":null,"abstract":"Defect-tolerant techniques can be effectively applied to regular structures which allow a very simple reconfiguration technique. A typical example is represented by memories, where algorithms for row and column elimination grant very good results with a limited area overhead (namely, a limited number of spare rows and columns). The reconfiguration technologies developed for memories could be applied to other devices only if the two conditions of regularity and simplicity can be transferred to their architectures. In the present paper we propose a methodology aiming at designing an intrinsically regular data path thus achieving defect-tolerance with a limited area increase, both in terms of spare functional units and memories and in terms of augmented interconnection network.","PeriodicalId":245879,"journal":{"name":"Proceedings 1998 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (Cat. No.98EX223)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Designing for yield: a defect-tolerant approach to high-level synthesis\",\"authors\":\"M. Broglia, G. Buonanno, M. Sami, M. Selvini\",\"doi\":\"10.1109/DFTVS.1998.732180\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Defect-tolerant techniques can be effectively applied to regular structures which allow a very simple reconfiguration technique. A typical example is represented by memories, where algorithms for row and column elimination grant very good results with a limited area overhead (namely, a limited number of spare rows and columns). The reconfiguration technologies developed for memories could be applied to other devices only if the two conditions of regularity and simplicity can be transferred to their architectures. In the present paper we propose a methodology aiming at designing an intrinsically regular data path thus achieving defect-tolerance with a limited area increase, both in terms of spare functional units and memories and in terms of augmented interconnection network.\",\"PeriodicalId\":245879,\"journal\":{\"name\":\"Proceedings 1998 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (Cat. No.98EX223)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1998 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (Cat. No.98EX223)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DFTVS.1998.732180\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1998 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (Cat. No.98EX223)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DFTVS.1998.732180","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

容错技术可以有效地应用于允许非常简单的重构技术的规则结构。一个典型的例子是内存,其中行和列消除算法在有限的区域开销(即有限数量的备用行和列)下获得非常好的结果。为存储器开发的重构技术,只有将规则性和简单性这两个条件转移到它们的架构中,才能应用于其他设备。在本文中,我们提出了一种方法,旨在设计一个本质上规则的数据路径,从而在有限的面积增加的情况下实现缺陷容忍,无论是在备用功能单元和存储器方面,还是在增强互连网络方面。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Designing for yield: a defect-tolerant approach to high-level synthesis
Defect-tolerant techniques can be effectively applied to regular structures which allow a very simple reconfiguration technique. A typical example is represented by memories, where algorithms for row and column elimination grant very good results with a limited area overhead (namely, a limited number of spare rows and columns). The reconfiguration technologies developed for memories could be applied to other devices only if the two conditions of regularity and simplicity can be transferred to their architectures. In the present paper we propose a methodology aiming at designing an intrinsically regular data path thus achieving defect-tolerance with a limited area increase, both in terms of spare functional units and memories and in terms of augmented interconnection network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信