The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2000 vol.49)
pp: 431-442
ABSTRACT
<p><b>Abstract</b>—An advanced spare-connection scheme for <it>k</it>-out-of-<it>n</it> redundancy called “generalized additional bypass linking” is proposed for constructing fault-tolerant massively parallel computers with series-connected, mesh-connected, or tree-connected processing element (PE) arrays. This scheme uses bypass links with wired OR connections to selectively connect the primary PEs to a spare PE in parallel. These bypass links are allocated to the primary PEs by node-coloring of a graph with a minimum inter-node distance of three in order to minimize the number of bypass links (i.e., the chromatic number). The main advantage of this scheme is that it can be used for constructing various <it>k</it>-out-of-<it>n</it> configurations capable of enhanced PE-to-PE communication and broadcast while still achieving strong fault tolerance for these PEs and links. In particular, it enables the construction of optimal <it>r</it>-strongly-fault-tolerant configurations capable of direct <it>k</it>-out-of-<it>n</it> selections by providing <it>r</it> spare PEs and <tmath>$r$</tmath> extra connections per PE for any kind of array when node-coloring with a distance of three is used. This simple spare-circuit structure enhances fault tolerance more than conventional schemes do. The node-coloring patterns were constructed using new node-coloring algorithms and the chromatic numbers were evaluated theoretically. Enhanced PE-to-PE communication and broadcast were achieved by using new fault-tolerant routing algorithms based on the properties of the node-coloring patterns with four or five message transmission steps being optimal configurations with any size array.</p>
INDEX TERMS
Processor array, mesh, tree, fault tolerance, k-out-of-n redundancy, additional bypass linking, graph-node coloring, enhanced communication and broadcast.
CITATION
Nobuo Tsuda, "Fault-Tolerant Processor Arrays Using Additional Bypass Linking Allocated by Graph-Node Coloring", IEEE Transactions on Computers, vol.49, no. 5, pp. 431-442, May 2000, doi:10.1109/12.859538
39 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool