A Novel Routing Algorithm for Achieving Static Fault-Tolerance in 2-D Meshes

Interconnection networks encompass a large number of technologies; from chip-to-chip communications to the system area networks (SANS), and in particular as the communication medium for multiprocessors. Interconnection networks offer communication with high reliability, high throughput, and low latency, all being vital factors for closely cooperating units. In the event that the interconnection network fails, the remainder of the system is left disconnected. Thus, it is essential to be able to keep the graceful degradation of reliability in these systems, even in the presence of faulty components. Adaptive fault-tolerant routing algorithms have been the subject of extensive research in recent years. In this paper, this issue is addressed through a new fault-tolerant routing algorithm to prevent static faults in interconnection networks with 2-D mesh topology. The suggested algorithm requires no change to the way packets are routed in the fault-free case, can be easily implemented, does not require the use of routing tables, and is well-suited for use in high-performance systems.