Advertisement

Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes

  • Thuy Dinh Duong
  • Keiichi Kaneko
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7016)

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.

Keywords

multicomputer interconnection network parallel processing fault-tolerant routing hypercube performance evaluation 

References

  1. 1.
    Al-Sadi, J., Day, K., Ould-Khaoua, M.: Fault-tolerant routing in hypercubes using probablity vectors. Parallel Computing 27(10), 1381–1399 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Al-Sadi, J., Day, K., Ould-Khaoua, M.: Probability-based fault-tolerant routing in hypercubes. The Computer Journal 44(5), 368–373 (2001)CrossRefzbMATHGoogle Scholar
  3. 3.
    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)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chiu, G.M., Wu, S.P.: A fault-tolerant routing strategy in hypercube multicomputers. IEEE Transactions on Computers 45(2), 143–155 (1996)CrossRefzbMATHGoogle Scholar
  5. 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. 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
  7. 7.
    Seitz, C.L.: The cosmic cube. Communications of the ACM 28(1), 22–33 (1985)CrossRefGoogle Scholar
  8. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Thuy Dinh Duong
    • 1
  • Keiichi Kaneko
    • 1
  1. 1.Department of Computer and Information Sciences Graduate School of EngineeringTokyo University of Agriculture and TechnologyKoganei-shiJapan

Personalised recommendations