{"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}
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.<>