Configurable PC clusters using a hierarchical complete-connection-based switching network

N. Tsuda
{"title":"Configurable PC clusters using a hierarchical complete-connection-based switching network","authors":"N. Tsuda","doi":"10.1109/PRDC.2002.1185632","DOIUrl":null,"url":null,"abstract":"An advanced interconnection network called \"HCC-ABL-tree (hierarchical completely-connected tree by additional bypass linking)\" is proposed for constructing large PC clusters capable of distributed inter-node communication by using Ethernet switches with a small number of I/O-ports. A basic one-level CC-ABL-tree can be constructed by using small subarrays of processing nodes (PCs) providing interconnections with the complete connection scheme, and by connecting the nodes to a tree-structured bypass network with switches with a height of two so that every node of the subarray is allocated to a different second-level switch. A two- or three-level HCC-ABL-tree can be constructed by using the trees with one less number of levels as the components by connecting them to each other with the complete-connection scheme by using the second-level switches of the bypass network as the hierarchical interconnections. The maximum number of processing nodes in a cluster can be increased exponentially by increasing the number of hierarchical levels. The network diameter is two for a one-level tree, three for a two-level tree, and seven for a three-level tree. The proposed network can configure the processing nodes in the cluster as a square-mesh-connected array with any aspect ratio by graph embedding, where a newly proposed distributed routing algorithm can define the paths with no duplicated use of a link. This manner of configuring can also be achieved even when busy or faulty nodes exist in the cluster, while bypassing these nodes in a node-disjoint manner with a small congestion and dilation in the paths.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"286 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2002.1185632","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

An advanced interconnection network called "HCC-ABL-tree (hierarchical completely-connected tree by additional bypass linking)" is proposed for constructing large PC clusters capable of distributed inter-node communication by using Ethernet switches with a small number of I/O-ports. A basic one-level CC-ABL-tree can be constructed by using small subarrays of processing nodes (PCs) providing interconnections with the complete connection scheme, and by connecting the nodes to a tree-structured bypass network with switches with a height of two so that every node of the subarray is allocated to a different second-level switch. A two- or three-level HCC-ABL-tree can be constructed by using the trees with one less number of levels as the components by connecting them to each other with the complete-connection scheme by using the second-level switches of the bypass network as the hierarchical interconnections. The maximum number of processing nodes in a cluster can be increased exponentially by increasing the number of hierarchical levels. The network diameter is two for a one-level tree, three for a two-level tree, and seven for a three-level tree. The proposed network can configure the processing nodes in the cluster as a square-mesh-connected array with any aspect ratio by graph embedding, where a newly proposed distributed routing algorithm can define the paths with no duplicated use of a link. This manner of configuring can also be achieved even when busy or faulty nodes exist in the cluster, while bypassing these nodes in a node-disjoint manner with a small congestion and dilation in the paths.
使用分层完全连接交换网络的可配置PC集群
提出了一种先进的互连网络“HCC-ABL-tree(通过附加旁路链路分层完全连接树)”,用于利用具有少量I/ o端口的以太网交换机构建能够分布式节点间通信的大型PC集群。一个基本的一级cc - abl树可以通过使用提供完整连接方案互连的处理节点(pc)的小子阵列,并将这些节点连接到具有2个高度交换机的树状结构旁路网络中,从而将子阵列的每个节点分配给不同的二级交换机来构建。利用旁路网络的二级交换机作为分层互连,采用完全连接的方式,以少一级的树为组件,将它们连接起来,可以构造两级或三级的hc - abl树。通过增加层次级别的数量,集群中的最大处理节点数量可以呈指数级增长。对于一级树,网络直径为2,对于二级树,网络直径为3,对于三级树,网络直径为7。该网络可以通过图嵌入将集群中的处理节点配置为任意纵横比的正方形网格连接阵列,其中新提出的分布式路由算法可以在不重复使用链路的情况下定义路径。即使集群中存在繁忙或故障节点,也可以实现这种配置方式,同时以节点不连接的方式绕过这些节点,在路径中产生较小的拥塞和扩展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信