Fault tolerance of adaptive routing algorithms in multicomputers

In distributed memory computers with topologies of hypercubes, meshes and torus, adaptive routing algorithms are used now over fixed path routing for better performance. In this paper, we show that adaptive routing algorithms, are good for tolerating failures in the system. We will show that adaptive routing techniques result in gracefully degradable systems. These results indicate that adaptive routing is a favorable option for tolerating failures, in systems with medium to large granularity of communication.