在故障超立方体中嵌入二维网格的重构

S. Nakano, N. Kamiura, Y. Hata, N. Matsui
{"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}
引用次数: 1

摘要

本文讨论了嵌入在超立方体中的二维网格在链路和/或节点失效情况下的重构问题。首先,我们假设只有链路故障可能发生。我们的方法包括两个阶段。第一阶段为网格的两个方向分配超立方体的维度,使行或列的损失尽可能小。第二阶段通过给每个节点分配两个Gray码序列的笛卡尔积来建立网格通信。我们使用深度优先搜索或通用算法生成这些序列。该方法可以应用于节点故障,将故障节点视为链路完全故障的节点。仿真结果表明,该方法可以在较短的计算时间内实现大型网格的重构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信