Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes
Recently, parallel processing systems have been studied very actively, and many topologies have been proposed. A hypercube is one of the most popular topologies for interconnection networks. In this paper, we propose two new fault-tolerant routing algorithms for hypercubes based on approximate directed routable probabilities. The probability represents ability of routing to any node at a specific distance and also taking account of from which direction the message was received. Each node chooses one of its neighbor nodes to send a message by comparing the approximate directed routable probabilities. We also conducted a computer experiment to verify the effectiveness of our algorithms.
Keywordsmulticomputer interconnection network parallel processing fault-tolerant routing hypercube performance evaluation
- 5.Duong, D.T., Kaneko, K.: Fault-tolerant routing algorithms based on approximate routable probabilities for hypercube networks. In: Proceedings of the 2011 International Conference on Parallel and Distributed Processing Techniques and Applications (July 2011)Google Scholar
- 6.Kaneko, K., Ito, H.: Fault-tolerant routing algorithms for hypercube interconnection networks. IEICE Transactions on Information and Systems E84-D(1), 121–128 (2001)Google Scholar
- 8.Wu, J.: Adaptive fault-tolerant routing in cube-based multicomputers using safety vectors. IEEE Transactions on Parallel and Distributed Systems 9(4), 322–334 (1998)Google Scholar