| Project/Area Number |
15500054
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Computer system/Network
|
|---|
| Research Institution | Kanazawa Institute of Technology |
|---|
Principal Investigator |
TSUDA Nobuo Kanazawa Institute of Technology, Dep.of Engineering, Professor, 工学部, 教授 (10298185)
|
|---|
| Project Period (FY) |
2003 – 2005
|
| Project Status |
Completed (Fiscal Year 2005)
|
| Budget Amount *help |
¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2005: ¥500,000 (Direct Cost: ¥500,000)
Fiscal Year 2004: ¥500,000 (Direct Cost: ¥500,000)
Fiscal Year 2003: ¥2,500,000 (Direct Cost: ¥2,500,000)
|
|---|
| Keywords | PC cluster / interconnection network / parallel and distributed processing / reconfiguration / ring / mesh / circulant graph / fault tolerance |
|---|
| Research Abstract |
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.
|
