Name
Title | ||
|---|---|---|
Fault-Tolerant Hierarchical Interconnection Networks Constructed by Additional Bypass Linking with Graph-Node Coloring |
Abstract | ||
|---|---|---|
A hierarchical redundancy scheme using additional bypass linking (ABL) is proposed for constructing fault-tolerant massively parallel computers with hierarchically ring-connected, mesh-connected, and cube-connected interconnection networks. This scheme enables a redundant hierarchical network to be constructed with a simple nested structure by using a feature of the ABL scheme, which is that it uses graph-node coloring for bypass allocation to the component network in order to minimize the number of bypass links and that the redundant component network can be treated as a processing element (PE) with a fixed number of external connections if these connections are provided in the bypass links. The spare circuits with hierarchical structures can greatly enhance PE-to-PE communications while achieving strong fault tolerance. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/DFTVS.1997.628329 | DFT |
Keywords | Field | DocType |
hierarchical redundancy scheme,cube-connected interconnection network,bypass allocation,additional bypass,hierarchical structure,component network,bypass link,redundant hierarchical network,abl scheme,graph-node coloring,fault-tolerant hierarchical interconnection networks,redundant component network,redundancy,concurrent computing,hypercubes,fault tolerance,computer networks,hardware,fault tolerant | Spare part,Computer science,Massively parallel,Fault tolerance,Redundancy (engineering),Processing element,Electronic circuit,Interconnection,Distributed computing,Graph Node | Conference |
ISBN | Citations | PageRank |
0-8186-8168-3 | 1 | 0.39 |
References | Authors | |
5 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nobuo Tsuda | 1 | 24 | 6.78 |