Reconfiguration in a circuit-switched k-ary tree multiprocessor

Abstract In this paper, we present a strongly faulttolerant design for the l-level k-ary tree multiprocessor and examine its reconfigurability. Our design assigns one spare node to the regular nodes of each subtree with lc levels. Moreover, spare nodes are interconnected to form a spare tree. 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. Both theoretical and simulation results are examined. Compared with other proposed schemes, our approach can tolerate significantly more faulty nodes and faulty links with a low overhead and no performance degradation