节点故障双立方体容错循环嵌入

Yamin Li, S. Peng, Wanming Chu
{"title":"节点故障双立方体容错循环嵌入","authors":"Yamin Li, S. Peng, Wanming Chu","doi":"10.1109/PDCAT.2003.1236261","DOIUrl":null,"url":null,"abstract":"A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m+1 links per node where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2/sup m+1/ clusters and hence the total number of nodes is 2/sup 2m+1/ in a DC(m). By using Gray code, we show that a DC(m) is (m-1)-link Hamiltonian and there exists a faulty-free cycle containing at least 2/sup 2m+1/-2f nodes with f/spl les/m-1 faulty nodes.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Fault-tolerant cycle embedding in dual-cube with node faulty\",\"authors\":\"Yamin Li, S. Peng, Wanming Chu\",\"doi\":\"10.1109/PDCAT.2003.1236261\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m+1 links per node where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2/sup m+1/ clusters and hence the total number of nodes is 2/sup 2m+1/ in a DC(m). By using Gray code, we show that a DC(m) is (m-1)-link Hamiltonian and there exists a faulty-free cycle containing at least 2/sup 2m+1/-2f nodes with f/spl les/m-1 faulty nodes.\",\"PeriodicalId\":145111,\"journal\":{\"name\":\"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2003.1236261\",\"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 of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2003.1236261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

提出了一种低次双立方体作为超立方体的替代方案。双立方体数据中心(m)每个节点有m+1条链路,其中m是集群的程度(m-cube),另外一条链路用于连接到另一个集群中的节点。有2/sup m+1/个集群,因此一个DC(m)的节点总数为2/sup 2m+1/个。利用Gray码证明了DC(m)是(m-1)链路哈密顿量,并且存在一个包含至少2/sup 2m+1/-2f个节点和f/spl个节点/m-1个故障节点的无故障环。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fault-tolerant cycle embedding in dual-cube with node faulty
A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m+1 links per node where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2/sup m+1/ clusters and hence the total number of nodes is 2/sup 2m+1/ in a DC(m). By using Gray code, we show that a DC(m) is (m-1)-link Hamiltonian and there exists a faulty-free cycle containing at least 2/sup 2m+1/-2f nodes with f/spl les/m-1 faulty nodes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信