{"title":"品种超立方体-一种新的大规模多计算机互连网络拓扑结构","authors":"S.-Y. Cheng, J.-H. Chuang","doi":"10.1109/ICPADS.1994.590445","DOIUrl":null,"url":null,"abstract":"The paper proposes a new interconnection network topology, called varietal hypercube for large scale multicomputer systems. An n-dimensional varietal hypercube is constructed by two (n-1)-dimensional varietal hypercubes in a way similar to that for the hypercube except for some minor modifications. The resulting network has the same number of nodes and links as the hypercube, and has most of the desirable properties of the hypercube, including recursive structure, partionability, strong connectivity, and the ability to embed other architectures such as ring and mesh. The diameter of the varietal hypercube is about two thirds of the diameter of the hypercube. The average distance of the varietal hypercube is also smaller than that of the hypercube. Optimal routing and broadcasting algorithms which guarantee the shortest path communication are developed. Comparisons with other variations of the hypercube, such as twisted cube, folded hypercube, and crossed cube, are also included.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Varietal hypercube-a new interconnection network topology for large scale multicomputer\",\"authors\":\"S.-Y. Cheng, J.-H. Chuang\",\"doi\":\"10.1109/ICPADS.1994.590445\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper proposes a new interconnection network topology, called varietal hypercube for large scale multicomputer systems. An n-dimensional varietal hypercube is constructed by two (n-1)-dimensional varietal hypercubes in a way similar to that for the hypercube except for some minor modifications. The resulting network has the same number of nodes and links as the hypercube, and has most of the desirable properties of the hypercube, including recursive structure, partionability, strong connectivity, and the ability to embed other architectures such as ring and mesh. The diameter of the varietal hypercube is about two thirds of the diameter of the hypercube. The average distance of the varietal hypercube is also smaller than that of the hypercube. Optimal routing and broadcasting algorithms which guarantee the shortest path communication are developed. Comparisons with other variations of the hypercube, such as twisted cube, folded hypercube, and crossed cube, are also included.\",\"PeriodicalId\":154429,\"journal\":{\"name\":\"Proceedings of 1994 International Conference on Parallel and Distributed Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 International Conference on Parallel and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.1994.590445\",\"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 1994 International Conference on Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.1994.590445","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Varietal hypercube-a new interconnection network topology for large scale multicomputer
The paper proposes a new interconnection network topology, called varietal hypercube for large scale multicomputer systems. An n-dimensional varietal hypercube is constructed by two (n-1)-dimensional varietal hypercubes in a way similar to that for the hypercube except for some minor modifications. The resulting network has the same number of nodes and links as the hypercube, and has most of the desirable properties of the hypercube, including recursive structure, partionability, strong connectivity, and the ability to embed other architectures such as ring and mesh. The diameter of the varietal hypercube is about two thirds of the diameter of the hypercube. The average distance of the varietal hypercube is also smaller than that of the hypercube. Optimal routing and broadcasting algorithms which guarantee the shortest path communication are developed. Comparisons with other variations of the hypercube, such as twisted cube, folded hypercube, and crossed cube, are also included.