正交边有备件的网格连接处理器阵列的可降解重构

I. Takanami, Masaru Fukushi
{"title":"正交边有备件的网格连接处理器阵列的可降解重构","authors":"I. Takanami, Masaru Fukushi","doi":"10.1109/PRDC.2018.00011","DOIUrl":null,"url":null,"abstract":"We present a restructuring method to apply a degradation approach to mesh-connected processor arrays with spare processing elements on the orthogonal sides of the arrays. An array with faulty processing elements is restructured by shifting healthy processing elements toward faulty processing elements using single track switches. First, an algorithm which satisfies the necessary and sufficient condition (called a restructurable condition) that an array is restructured so that its logical size is kept is briefly explained. Next, a method that if the array does not satisfy the restructurable condition, its rows and/or columns are functionally deleted so that the subarray with the remaining rows and columns satisfies the restructurable condition is presented. Finally, the simulation results are shown.","PeriodicalId":409301,"journal":{"name":"2018 IEEE 23rd Pacific Rim International Symposium on Dependable Computing (PRDC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Degradable Restructuring of Mesh-Connected Processor Arrays with Spares on Orthogonal Sides\",\"authors\":\"I. Takanami, Masaru Fukushi\",\"doi\":\"10.1109/PRDC.2018.00011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a restructuring method to apply a degradation approach to mesh-connected processor arrays with spare processing elements on the orthogonal sides of the arrays. An array with faulty processing elements is restructured by shifting healthy processing elements toward faulty processing elements using single track switches. First, an algorithm which satisfies the necessary and sufficient condition (called a restructurable condition) that an array is restructured so that its logical size is kept is briefly explained. Next, a method that if the array does not satisfy the restructurable condition, its rows and/or columns are functionally deleted so that the subarray with the remaining rows and columns satisfies the restructurable condition is presented. Finally, the simulation results are shown.\",\"PeriodicalId\":409301,\"journal\":{\"name\":\"2018 IEEE 23rd Pacific Rim International Symposium on Dependable Computing (PRDC)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 23rd Pacific Rim International Symposium on Dependable Computing (PRDC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PRDC.2018.00011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 23rd Pacific Rim International Symposium on Dependable Computing (PRDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2018.00011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们提出了一种重构方法,将退化方法应用于网格连接的处理器阵列,阵列的正交侧具有备用加工单元。通过使用单轨开关将健康处理元素转移到故障处理元素,重构了具有故障处理元素的阵列。首先,简要介绍了一种算法,该算法满足必要和充分条件(称为可重构条件),即重构数组以保持其逻辑大小。接下来,提出了一种方法,即如果数组不满足可重构条件,则功能性地删除其行和/或列,以便具有剩余行和列的子数组满足可重构条件。最后给出了仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Degradable Restructuring of Mesh-Connected Processor Arrays with Spares on Orthogonal Sides
We present a restructuring method to apply a degradation approach to mesh-connected processor arrays with spare processing elements on the orthogonal sides of the arrays. An array with faulty processing elements is restructured by shifting healthy processing elements toward faulty processing elements using single track switches. First, an algorithm which satisfies the necessary and sufficient condition (called a restructurable condition) that an array is restructured so that its logical size is kept is briefly explained. Next, a method that if the array does not satisfy the restructurable condition, its rows and/or columns are functionally deleted so that the subarray with the remaining rows and columns satisfies the restructurable condition is presented. Finally, the simulation results are shown.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信