如何布局阵列的行和列

L. LaForge
{"title":"如何布局阵列的行和列","authors":"L. LaForge","doi":"10.1109/ICISS.1997.630244","DOIUrl":null,"url":null,"abstract":"Perhaps the most common fault tolerant architecture configures a nominal t/spl times/at array using bt dedicated spare rows and ct dedicated spare columns. We counterexample an outstanding conjecture by constructively showing how dedicated sparing can be laid out in area proportional to the number of elements. However, we find that dedicated sparing is more costly than homogeneous extraction of a t/spl times/at array from a (1+b)t/spl times/(a+c)t array. i) In the presence of failures whose distribution is worst-case, iid, or clustered, the fault tolerance of either architecture is /spl Theta/(t/sup -1/). ii) At constant proportion of failures, the area of homogeneous arrays is /spl Theta/(exp t), while that of dedicated sparing is /spl Omega/(exp t). iii) The worst-case wirelength of either architecture is /spl Theta/(ct). iv) The best-case wirelength /spl Theta/(1) of homogeneous sparing is less than that /spl Theta/(t) of dedicated sparing. V) Probabilisticaily, homogeneous sparing has O(log t) wirelength, less than that /spl Theta/(t) of dedicated sparing. For large t, moreover, row-column sparing is more costly than local sparing.","PeriodicalId":357602,"journal":{"name":"1997 Proceedings Second Annual IEEE International Conference on Innovative Systems in Silicon","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"How to lay out arrays spared by rows and columns\",\"authors\":\"L. LaForge\",\"doi\":\"10.1109/ICISS.1997.630244\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Perhaps the most common fault tolerant architecture configures a nominal t/spl times/at array using bt dedicated spare rows and ct dedicated spare columns. We counterexample an outstanding conjecture by constructively showing how dedicated sparing can be laid out in area proportional to the number of elements. However, we find that dedicated sparing is more costly than homogeneous extraction of a t/spl times/at array from a (1+b)t/spl times/(a+c)t array. i) In the presence of failures whose distribution is worst-case, iid, or clustered, the fault tolerance of either architecture is /spl Theta/(t/sup -1/). ii) At constant proportion of failures, the area of homogeneous arrays is /spl Theta/(exp t), while that of dedicated sparing is /spl Omega/(exp t). iii) The worst-case wirelength of either architecture is /spl Theta/(ct). iv) The best-case wirelength /spl Theta/(1) of homogeneous sparing is less than that /spl Theta/(t) of dedicated sparing. V) Probabilisticaily, homogeneous sparing has O(log t) wirelength, less than that /spl Theta/(t) of dedicated sparing. For large t, moreover, row-column sparing is more costly than local sparing.\",\"PeriodicalId\":357602,\"journal\":{\"name\":\"1997 Proceedings Second Annual IEEE International Conference on Innovative Systems in Silicon\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1997 Proceedings Second Annual IEEE International Conference on Innovative Systems in Silicon\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISS.1997.630244\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1997 Proceedings Second Annual IEEE International Conference on Innovative Systems in Silicon","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISS.1997.630244","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

也许最常见的容错体系结构配置一个标称的t/spl times/at数组,使用bt专用备用行和ct专用备用列。我们通过建设性地展示如何在与元素数量成比例的区域中布置专用节约来反例一个杰出的猜想。然而,我们发现专用的节省比从a (1+b)t/spl times/(a+c)t数组中均匀提取t/spl times/at数组的成本更高。i)在故障分布为最坏情况、iid或聚类的情况下,任一架构的容错能力为/spl Theta/(t/sup -1/)。ii)在故障比例恒定的情况下,均匀阵列的面积为/spl Theta/(exp t),而专用保护的面积为/spl Omega/(exp t)。iii)两种架构的最坏情况下的波长均为/spl Theta/(ct)。iv)均匀保护的最佳情况下的带宽/spl Theta/(1)小于专用保护的带宽/spl Theta/(t)。V)从概率上讲,均匀节约的带宽为O(log t),小于专用节约的/spl Theta/(t)。此外,对于大t,行-列节省比局部节省成本更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
How to lay out arrays spared by rows and columns
Perhaps the most common fault tolerant architecture configures a nominal t/spl times/at array using bt dedicated spare rows and ct dedicated spare columns. We counterexample an outstanding conjecture by constructively showing how dedicated sparing can be laid out in area proportional to the number of elements. However, we find that dedicated sparing is more costly than homogeneous extraction of a t/spl times/at array from a (1+b)t/spl times/(a+c)t array. i) In the presence of failures whose distribution is worst-case, iid, or clustered, the fault tolerance of either architecture is /spl Theta/(t/sup -1/). ii) At constant proportion of failures, the area of homogeneous arrays is /spl Theta/(exp t), while that of dedicated sparing is /spl Omega/(exp t). iii) The worst-case wirelength of either architecture is /spl Theta/(ct). iv) The best-case wirelength /spl Theta/(1) of homogeneous sparing is less than that /spl Theta/(t) of dedicated sparing. V) Probabilisticaily, homogeneous sparing has O(log t) wirelength, less than that /spl Theta/(t) of dedicated sparing. For large t, moreover, row-column sparing is more costly than local sparing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信