{"title":"Incrementally extensible hypercube (IEH) graphs","authors":"S. Sur, P. Srimani","doi":"10.1109/PCCC.1992.200531","DOIUrl":null,"url":null,"abstract":"The authors propose a new family of interconnection topology that can be used to design communication architectures for distributed systems with an arbitrary number of computing nodes. The design is based on a novel generalization of the well-known hypercube graphs. The proposed topology is shown to be incrementally extensible in steps of 1 and to be optimally fault tolerant, and its diameter is logarithmic in the number of nodes. For any given number of nodes, the difference of the maximum and the minimum degree of a node in the graph is <or=1, i.e. the graph is almost regular.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200531","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
The authors propose a new family of interconnection topology that can be used to design communication architectures for distributed systems with an arbitrary number of computing nodes. The design is based on a novel generalization of the well-known hypercube graphs. The proposed topology is shown to be incrementally extensible in steps of 1 and to be optimally fault tolerant, and its diameter is logarithmic in the number of nodes. For any given number of nodes, the difference of the maximum and the minimum degree of a node in the graph is >
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
