{"title":"在故障超立方体中嵌入二维网格的重构","authors":"S. Nakano, N. Kamiura, Y. Hata, N. Matsui","doi":"10.1109/DFTVS.1999.802907","DOIUrl":null,"url":null,"abstract":"In this paper we discuss the reconfiguration of two-dimensional meshes embedded in hypercubes with link and/or node failures. First, we assume that only the link failures may occur. Our method consists of two stages. The first stage assigns dimensions of hypercube to two directions of mesh so that the losses of rows or columns would be as small as possible. The second stage establishes the mesh communication by assigning the Cartesian product of two Gray code sequences to every node. We generate these sequences with a depth-first search or generic algorithm. This method can be applied to node failures by regarding a faulty node as a node whose links are entirely faulty. Our simulation results show that our method can reconfigure large meshes with short computation time.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Reconfiguration of two-dimensional meshes embedded in faulty hypercubes\",\"authors\":\"S. Nakano, N. Kamiura, Y. Hata, N. Matsui\",\"doi\":\"10.1109/DFTVS.1999.802907\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we discuss the reconfiguration of two-dimensional meshes embedded in hypercubes with link and/or node failures. First, we assume that only the link failures may occur. Our method consists of two stages. The first stage assigns dimensions of hypercube to two directions of mesh so that the losses of rows or columns would be as small as possible. The second stage establishes the mesh communication by assigning the Cartesian product of two Gray code sequences to every node. We generate these sequences with a depth-first search or generic algorithm. This method can be applied to node failures by regarding a faulty node as a node whose links are entirely faulty. Our simulation results show that our method can reconfigure large meshes with short computation time.\",\"PeriodicalId\":448322,\"journal\":{\"name\":\"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DFTVS.1999.802907\",\"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 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DFTVS.1999.802907","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reconfiguration of two-dimensional meshes embedded in faulty hypercubes
In this paper we discuss the reconfiguration of two-dimensional meshes embedded in hypercubes with link and/or node failures. First, we assume that only the link failures may occur. Our method consists of two stages. The first stage assigns dimensions of hypercube to two directions of mesh so that the losses of rows or columns would be as small as possible. The second stage establishes the mesh communication by assigning the Cartesian product of two Gray code sequences to every node. We generate these sequences with a depth-first search or generic algorithm. This method can be applied to node failures by regarding a faulty node as a node whose links are entirely faulty. Our simulation results show that our method can reconfigure large meshes with short computation time.