A dual-channel binary hypercube network

Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI:10.1109/PCCC.1994.504125

Qiang Li

{"title":"A dual-channel binary hypercube network","authors":"Qiang Li","doi":"10.1109/PCCC.1994.504125","DOIUrl":null,"url":null,"abstract":"This paper presents a deadlock-free direct binary hypercube network called the dual-channel hypercube. From a node to another of distance k, L + 1 simultaneous disjoint deadlockfree paths are provided. Large data sets can be partitioned and sent through multiple paths simultaneously, which implies a high inter-node bandwidth. In contrast, the e-cube routing algorithm in the traditional hypercube provides only one such path. Furthermore, a large number of deadlock-free routing choices from one node to another provides low routing latency and fault tolerance. Since the deadlock prevention is done by imposing routing restrictions, it can be used with wormhole routing providing every low routing latency. This paper first presents the dual-channel hypercube topology and the deadlock-free routing restrictions, and then concentrates on the high bandwidth aspect of the network. A multiple-path deadlock-free fixed routing algorithm is presented. A performance study of the dual-channel hypercube network under the fixed routing algorithm is also presented, which shows a significant increase of inter-node bandwidth.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1994.504125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

This paper presents a deadlock-free direct binary hypercube network called the dual-channel hypercube. From a node to another of distance k, L + 1 simultaneous disjoint deadlockfree paths are provided. Large data sets can be partitioned and sent through multiple paths simultaneously, which implies a high inter-node bandwidth. In contrast, the e-cube routing algorithm in the traditional hypercube provides only one such path. Furthermore, a large number of deadlock-free routing choices from one node to another provides low routing latency and fault tolerance. Since the deadlock prevention is done by imposing routing restrictions, it can be used with wormhole routing providing every low routing latency. This paper first presents the dual-channel hypercube topology and the deadlock-free routing restrictions, and then concentrates on the high bandwidth aspect of the network. A multiple-path deadlock-free fixed routing algorithm is presented. A performance study of the dual-channel hypercube network under the fixed routing algorithm is also presented, which shows a significant increase of inter-node bandwidth.

查看原文本刊更多论文

双通道二进制超立方体网络

本文提出了一种无死锁的直接二进制超立方体网络，称为双通道超立方体。从一个节点到另一个距离为k的节点，提供L + 1条同时不相交的无死锁路径。大型数据集可以同时通过多条路径进行分区和发送，这意味着节点间带宽很高。相比之下，传统超立方体中的e-cube路由算法只提供了一条这样的路径。此外，从一个节点到另一个节点的大量无死锁路由选择提供了低路由延迟和容错性。由于死锁预防是通过施加路由限制来实现的，因此它可以与提供低路由延迟的虫洞路由一起使用。本文首先介绍了双通道超立方体拓扑和无死锁路由限制，然后重点讨论了网络的高带宽方面。提出了一种无死锁的多路径固定路由算法。对双通道超立方体网络在固定路由算法下的性能进行了研究，结果表明节点间带宽显著增加。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications

自引率

0.00%

发文量