IEEE Transactions on Computers
Fault-tolerant meshes with small degree
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Design of fault-tolerant distributed memory multiprocessors
Design of fault-tolerant distributed memory multiprocessors
Routing in Modular Fault-Tolerant Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
An efficient reconfiguration scheme for fault-tolerant meshes
Information Sciences—Informatics and Computer Science: An International Journal
An efficient reconfiguration scheme for fault-tolerant meshes
Information Sciences: an International Journal
Extraconnectivity of k-ary n-cube networks
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with (k/j)^n spare nodes; each set of j^n regular nodes is connected to a spare node and the spare nodes are interconnected as a (k/j)-ary n-cube. Our approach utilizes the circuit-switched capabilities of the communication modules of the spare nodes to tolerate a large number of faulty nodes and faulty links without any performance degradation. Both theoretical and simulation results are presented.