权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Research on Configurable PC Clusters Capable of Distributed Inter-Node Communication

分布式节点间通信的可配置PC集群研究

基本信息

批准号：
15500054
负责人：
TSUDA Nobuo
金额：
$ 2.24万
依托单位：
Kanazawa Institute of Technology
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (C)
财政年份：
2003
资助国家：
日本
起止时间：
2003 至 2005
项目状态：
已结题

来源：
https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-15500054/
关键词：
PC cluster interconnection network parallel and distributed processing reconfiguration ring mesh circulant graph fault tolerance

项目摘要

An advanced interconnection network called HCC ABL-tree is proposed for constructing large PC clusters capable of distributed inter-node communication within a small diameter of the network. A basic ABL-tree can be constructed by using small subarrays of the processing nodes interconnected as a ring-, completely-, or two-dimensional toroidal mesh-connected graph. These nodes are connected to a tree-structured network with switches of a hub type according to a node-coloring pattern with an inter-node distance of three so that any node and its neighbors in the subarray are connected to a different switch provided in the leaf level of the tree. To construct very large PC clusters, the ABL-tree can be expanded as an h-level HCC ABL-tree. In this network, the ABL-trees are used as the component of an h-level hierarchical completely-connected graph and the switches are commonly used as interconnections in every hierarchical level. Parallel inter-node communication can be achieved via the switches in the leaf level in a distributed manner while using a neighboring node of the source node in the subarray as relay node whose color is the same as that of the destination node. The proposed network can configure the processing nodes in it as a square toroidal mesh-connected array with any aspect ratio by graph-embedding. A newly proposed multiplex distributed routing algorithm can define the paths of the embedded graph while bypassing busy or faulty nodes in the array in a node-disjoint manner with a small congestion and dilation in the paths. The final report includes a new construction method for HCC ABL-trees by using circulant graphs, fault-tolerant configuring, multiplex distributed routing, prototype PC clusters, and performance evaluation of inter-node communication and practical parallel processing.

提出了一种称为 HCC ABL 树的高级互连网络，用于构建能够在小网络直径内进行分布式节点间通信的大型 PC 集群。基本的 ABL 树可以通过使用互连为环形、完全或二维环形网格连接图的处理节点的小子阵列来构建。这些节点根据节点间距离为三的节点着色模式连接到具有集线器类型交换机的树形结构网络，使得子阵列中的任何节点及其邻居都连接到树的叶级中提供的不同交换机。为了构建非常大的 PC 集群，ABL 树可以扩展为 h 级 HCC ABL 树。在该网络中，ABL树被用作h层分层完全连通图的组成部分，并且交换机通常用作每个分层中的互连。利用子阵列中源节点的邻居节点作为与目的节点颜色相同的中继节点，通过叶级交换机以分布式方式实现并行的节点间通信。所提出的网络可以通过图嵌入将其中的处理节点配置为具有任意纵横比的方形环形网格连接阵列。新提出的多路分布式路由算法可以定义嵌入图的路径，同时以节点不相交的方式绕过阵列中繁忙或故障的节点，路径中的拥塞和膨胀较小。最终报告包括一种新的 HCC ABL 树构建方法，该方法使用循环图、容错配置、多路分布式路由、原型 PC 集群以及节点间通信和实际并行处理的性能评估。