Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithms and Architectures for Parallel Processing

ICA3PP 2011: Algorithms and Architectures for Parallel Processing pp 106–116Cite as

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Sadi, J., Day, K., Ould-Khaoua, M.: Fault-tolerant routing in hypercubes using probablity vectors. Parallel Computing 27(10), 1381–1399 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Al-Sadi, J., Day, K., Ould-Khaoua, M.: Probability-based fault-tolerant routing in hypercubes. The Computer Journal 44(5), 368–373 (2001)

    Article  MATH  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  4. Chiu, G.M., Wu, S.P.: A fault-tolerant routing strategy in hypercube multicomputers. IEEE Transactions on Computers 45(2), 143–155 (1996)

    Article  MATH  Google Scholar 

  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 

  7. Seitz, C.L.: The cosmic cube. Communications of the ACM 28(1), 22–33 (1985)

    Article  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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Sciences Graduate School of Engineering, Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo, Japan

    Thuy Dinh Duong & Keiichi Kaneko

Authors
  1. Thuy Dinh Duong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keiichi Kaneko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125,, Burwood, VIC, Australia

    Yang Xiang

  2. ICAR-CNR and University of Calabria, Via P. Bucci 41 C, 87036, Rende (CS), Italy

    Alfredo Cuzzocrea

  3. School of Information Technology, Deakin University, Geelong Waurn Ponds Campus, Pigdons Road, 3217, Geelong, VIC, Australia

    Michael Hobbs

  4. School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125, Burwood, VIC, Australia

    Wanlei Zhou

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation