Date Added: Dec 2009
This paper describes a fault-tolerant routing mechanism to facilitate data routing in Torus embedded hypercube interconnection network subject to node failures in parallel computing. It is shown that by only using feasible paths routing can be substantially simplified. Though there are algorithms for fault tolerant communication in torus and hypercube networks, there exits no efficient algorithm for the embedded architecture. The authors present an algorithm to provide an efficient fault tolerant routing mechanism for a (2, 2, 8)-Torus embedded hypercube interconnection network.