榕树-超立方体网络的拓扑性质

A. Youssef, B. Narahari
{"title":"榕树-超立方体网络的拓扑性质","authors":"A. Youssef, B. Narahari","doi":"10.1109/FMPC.1990.89478","DOIUrl":null,"url":null,"abstract":"Topological properties of banyan-hypercubes are discussed, and a family of generalized banyan-hypercubes is defined. A banyan-hypercube, denoted BH(h, k, s), is constructed by taking the bottom h levels of a rectangular banyan of spread s and s/sup k/ nodes per level for s a power of two, and interconnecting the nodes at each level in a hypercube. BHs can be viewed as a scheme for interconnecting hypercubes while keeping most of the advantages of the latter. The definition of BHs is extended and generalized to allow the interconnection of an unlimited number of hypercubes and to allow any h successive levels of the banyan to interconnect hypercubes. This leads to better extendibility and flexibility in partitioning the BH. The diameter and average distance of the generalized BH are derived and are shown to provide an improvement over the hypercube for a wide range of h, k, and s values. Self-routing point-to-point and broadcasting algorithms are presented, and efficient embeddings of various networks on the BH are shown.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Topological properties of banyan-hypercube networks\",\"authors\":\"A. Youssef, B. Narahari\",\"doi\":\"10.1109/FMPC.1990.89478\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Topological properties of banyan-hypercubes are discussed, and a family of generalized banyan-hypercubes is defined. A banyan-hypercube, denoted BH(h, k, s), is constructed by taking the bottom h levels of a rectangular banyan of spread s and s/sup k/ nodes per level for s a power of two, and interconnecting the nodes at each level in a hypercube. BHs can be viewed as a scheme for interconnecting hypercubes while keeping most of the advantages of the latter. The definition of BHs is extended and generalized to allow the interconnection of an unlimited number of hypercubes and to allow any h successive levels of the banyan to interconnect hypercubes. This leads to better extendibility and flexibility in partitioning the BH. The diameter and average distance of the generalized BH are derived and are shown to provide an improvement over the hypercube for a wide range of h, k, and s values. Self-routing point-to-point and broadcasting algorithms are presented, and efficient embeddings of various networks on the BH are shown.<<ETX>>\",\"PeriodicalId\":193332,\"journal\":{\"name\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1990.89478\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1990.89478","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

讨论了榕树超立方体的拓扑性质,并定义了一类广义榕树超立方体。一个榕树-超立方体,记作BH(h, k, s),是通过取分布为s的矩形榕树的底部h层和s/sup / k/节点的每层(s为2的幂),并将超立方体中每层的节点互连来构建的。BHs可以被看作是一种连接超立方体的方案,同时保留了后者的大部分优点。对BHs的定义进行了扩展和推广,以允许无限数量的超立方体互连,并允许任意h个连续的banyan层互连超立方体。这样可以在划分BH时获得更好的可扩展性和灵活性。推导了广义黑洞的直径和平均距离,并证明它们在大范围的h、k和s值上优于超立方体。提出了自路由点对点和广播算法,并展示了各种网络在BH上的有效嵌入。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Topological properties of banyan-hypercube networks
Topological properties of banyan-hypercubes are discussed, and a family of generalized banyan-hypercubes is defined. A banyan-hypercube, denoted BH(h, k, s), is constructed by taking the bottom h levels of a rectangular banyan of spread s and s/sup k/ nodes per level for s a power of two, and interconnecting the nodes at each level in a hypercube. BHs can be viewed as a scheme for interconnecting hypercubes while keeping most of the advantages of the latter. The definition of BHs is extended and generalized to allow the interconnection of an unlimited number of hypercubes and to allow any h successive levels of the banyan to interconnect hypercubes. This leads to better extendibility and flexibility in partitioning the BH. The diameter and average distance of the generalized BH are derived and are shown to provide an improvement over the hypercube for a wide range of h, k, and s values. Self-routing point-to-point and broadcasting algorithms are presented, and efficient embeddings of various networks on the BH are shown.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信