一种新的超立方体网络分析方法

B. Jin, Lan Jin
{"title":"一种新的超立方体网络分析方法","authors":"B. Jin, Lan Jin","doi":"10.1109/ICDCS.1989.37955","DOIUrl":null,"url":null,"abstract":"A bit-positional notation is proposed for representing the interconnection topology of a hypercube. This approach greatly helps in the analysis of basic properties of a hypercube network. Some systematic procedures are derived to expand binary trees and map them into higher-dimensional hypercubes. The authors show that an n-cube network can be enhanced by adding at most 2/sup n-2/ diagonal links, which makes it possible to map a complete binary tree into a hypercube with any one of its nodes as the root. The problem of mapping mesh networks into hypercube networks is discussed.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new approach to hypercube network analysis\",\"authors\":\"B. Jin, Lan Jin\",\"doi\":\"10.1109/ICDCS.1989.37955\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A bit-positional notation is proposed for representing the interconnection topology of a hypercube. This approach greatly helps in the analysis of basic properties of a hypercube network. Some systematic procedures are derived to expand binary trees and map them into higher-dimensional hypercubes. The authors show that an n-cube network can be enhanced by adding at most 2/sup n-2/ diagonal links, which makes it possible to map a complete binary tree into a hypercube with any one of its nodes as the root. The problem of mapping mesh networks into hypercube networks is discussed.<<ETX>>\",\"PeriodicalId\":266544,\"journal\":{\"name\":\"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.1989.37955\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.1989.37955","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种表示超立方体互连拓扑的位位置表示法。这种方法对分析超立方体网络的基本性质有很大帮助。导出了一些系统的程序来展开二叉树并将它们映射到高维超立方体。作者证明了n-立方体网络可以通过添加最多2/sup n-2/对角线链路来增强,这使得将一个完全二叉树映射到一个以其任意一个节点为根的超立方体成为可能。讨论了将网状网络映射到超立方体网络的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new approach to hypercube network analysis
A bit-positional notation is proposed for representing the interconnection topology of a hypercube. This approach greatly helps in the analysis of basic properties of a hypercube network. Some systematic procedures are derived to expand binary trees and map them into higher-dimensional hypercubes. The authors show that an n-cube network can be enhanced by adding at most 2/sup n-2/ diagonal links, which makes it possible to map a complete binary tree into a hypercube with any one of its nodes as the root. The problem of mapping mesh networks into hypercube networks is discussed.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信