增量可扩展超立方体(IEH)图

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings] Pub Date : 1992-04-01 DOI:10.1109/PCCC.1992.200531

S. Sur, P. Srimani

{"title":"增量可扩展超立方体(IEH)图","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":"{\"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}","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

摘要

作者提出了一种新的互连拓扑，可用于设计具有任意数量计算节点的分布式系统的通信体系结构。该设计基于对众所周知的超立方图的一种新颖的推广。所提出的拓扑在步骤1中显示为增量可扩展的，并且具有最佳的容错性，其直径在节点数量上是对数的。对于任意给定数目的节点，图中节点的最大度与最小度之差为>

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Incrementally extensible hypercube (IEH) graphs

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 >

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]

自引率

0.00%

发文量