Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Al-Sadi, J., Day, K., Ould-Khaoua, M.: Fault-tolerant routing in hypercubes using probablity vectors. Parallel Computing 27(10), 1381–1399 (2001)
Al-Sadi, J., Day, K., Ould-Khaoua, M.: Probability-based fault-tolerant routing in hypercubes. The Computer Journal 44(5), 368–373 (2001)
Chiu, G.M., Chen, K.S.: Use of routing capability for fault-tolerant routing in hypercube multicomputers. IEEE Transactions on Computers 46(8), 953–958 (1997)
Chiu, G.M., Wu, S.P.: A fault-tolerant routing strategy in hypercube multicomputers. IEEE Transactions on Computers 45(2), 143–155 (1996)
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)
Kaneko, K., Ito, H.: Fault-tolerant routing algorithms for hypercube interconnection networks. IEICE Transactions on Information and Systems E84-D(1), 121–128 (2001)
Seitz, C.L.: The cosmic cube. Communications of the ACM 28(1), 22–33 (1985)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duong, T.D., Kaneko, K. (2011). Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2011. Lecture Notes in Computer Science, vol 7016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24650-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-24650-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24649-4
Online ISBN: 978-3-642-24650-0
eBook Packages: Computer ScienceComputer Science (R0)