Restructuring Mesh-Connected Processor Arrays with Spares on Four Sides by Orthogonal Side Rotation

I. Takanami, Masaru Fukushi
{"title":"Restructuring Mesh-Connected Processor Arrays with Spares on Four Sides by Orthogonal Side Rotation","authors":"I. Takanami, Masaru Fukushi","doi":"10.1109/PRDC.2018.00029","DOIUrl":null,"url":null,"abstract":"An array with spares on four sides and the restructuring algorithm for it were proposed in [1]. However, the restructuring algorithm described in [1] is too complicated to be realized in hardware. Here, we propose a method to improve such the situation. First, the array is considered to be an (N +2) (N +2) array if four PEs are added to the four corners of the array and the spares are included. The (N+2) (N+2) array is divided into four subarrays, each of which is of size (N=2 + 1)(N=2 + 1), and the orthogonal side rotation introduced here is individually applied to each subarray. The reliabilities are given by computer simulation. They fairly increase, comparing with those in [1]. :","PeriodicalId":409301,"journal":{"name":"2018 IEEE 23rd Pacific Rim International Symposium on Dependable Computing (PRDC)","volume":"12 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.00029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

An array with spares on four sides and the restructuring algorithm for it were proposed in [1]. However, the restructuring algorithm described in [1] is too complicated to be realized in hardware. Here, we propose a method to improve such the situation. First, the array is considered to be an (N +2) (N +2) array if four PEs are added to the four corners of the array and the spares are included. The (N+2) (N+2) array is divided into four subarrays, each of which is of size (N=2 + 1)(N=2 + 1), and the orthogonal side rotation introduced here is individually applied to each subarray. The reliabilities are given by computer simulation. They fairly increase, comparing with those in [1]. :
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
四边备件网格连接处理器阵列的正交边旋转重构
文献[1]提出了一种四面有备件的阵列及其重构算法。然而,文献[1]中描述的重构算法过于复杂,无法在硬件上实现。在此,我们提出一种方法来改善这种情况。首先,如果在数组的四个角上加上四个pe,并包括备件,则认为该数组为(N +2) (N +2)数组。(N+2) (N+2)数组被分成四个子数组,每个子数组的大小为(N=2 + 1)(N=2 + 1),这里介绍的正交侧旋转分别应用于每个子数组。通过计算机仿真给出了系统的可靠性。与文献[1]相比,它们明显增加。:
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SSCMSD - Single-Symbol Correction Multi-symbol Detection for DRAM Subsystem Cyber-Physical Transactions: A Method for Securing VANETs with Blockchains An Approach for Trustworthiness Benchmarking Using Software Metrics Semantic Failover in Software-Defined Networking InfoLeak: Scheduling-Based Information Leakage
×
引用
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