Paper Info
Title
Configurable PC Clusters Using a Hierarchical Complete-Connection-Based Switching Network
Abstract
An advanced interconnection network called "HCC-ABL-tree (hierarchical completely-connected tree by additionalbypass linking)" is proposed forconstructing large PCclusters capable of distributed inter-node communication by using Ethernet switches with a small number ofI/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 heightof two so that every node of the subarray is allocatedto a different second-level switch. A two-or three-level HCC-ABL-tree can be constructed by using thetrees with one less number of levels as the componentsby connecting them to each other with the complete-connection scheme by using the second-level switchesof the bypass network as the hierarchical interconnections. The maximum number of processing nodes in acluster can be increased exponentially by increasing thenumb er of hierarchical levels. The network diameteris two for a one-level tree, three for a two-level tree, and seven for a three-level tree. The proposed networkcan configure the processing nodes in the cluster as asquare-mesh-connected array with any aspect ratio bygraph embedding, where a newly proposed distributedrouting algorithm can define the paths with no duplicated use of a link. This manner of configuring canalso be achieved even when busy or faulty nodes are existing in the cluster, while bypassing these nodes in anode-disjoint manner with a small congestion and dilation in the paths.
Year
DOI
Venue
2002
10.1109/PRDC.2002.1185632
PRDC
Keywords
Field
DocType
one-level tree,two-level tree,three-level tree,configurable pc,advanced interconnection network,tree-structured bypass network,hierarchical completely-connected tree,hierarchical level,hierarchical interconnection,maximum number,bypass network,hierarchical complete-connection-based switching network,network routing,graph embedding,tree structure,aspect ratio,switching
Small number,Cluster (physics),Dilation (morphology),Graph embedding,Hierarchical routing,Computer science,Tree (data structure),Computer network,Ethernet,Interconnection,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-1852-4
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Nobuo Tsuda1246.78