{"title":"四边备件网格连接处理器阵列的正交边旋转重构","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":"{\"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}","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}
Restructuring Mesh-Connected Processor Arrays with Spares on Four Sides by Orthogonal Side Rotation
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]. :