Abstract
This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors. Each node calculates a probability vector whose kth element represents the probability that a destination node at distance k cannot be minimally reached due to a faulty node or link. A performance comparison with the recently-proposed safety vectors algorithm, through extensive simulation, shows that the new algorithm exhibits superior performance in terms of routing distances and percentage of reachability.
Chapter PDF
References
Chiu, G.M., Chen, K.-S.: Fault-tolerant routing strategy using routing capability in hypercube multicomputers, Proc. Int’l Conf. Parallel and Distributed Systems, pp. 396–403, 1996.
Lee, T.C.: J.P. Hayes, A fault-tolerant communication scheme for hypercube computers, IEEE Trans. Computers, vol. 41, no. 10, pp. 1,242–1,256, Oct. 1992.
Wu, J.: Adaptive fault-tolerant routing in cube-based multicomputers using safety vectors, IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 4, pp. 321–334, April 1998.
Wu J., Fernandez, E.B.: Broadcasting in faulty hypercubes, Proc. 11th Symp. Reliable Distributed Systems, pp. 122–129, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Al-Sadi, J., Day, K., Ould-Khaoua, M. (2000). Probability-Based Fault-Tolerant Routing in Hypercubes. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_131
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_131
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive