Skip to main content

Generalized Wormhole Switching: A New Fault-Tolerant Mathematical Model for Adaptively Wormhole-Routed Interconnect Networks

  • Conference paper
  • 905 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4697))

Abstract

In this paper, we introduce a new variant of WS which makes any adaptive routing algorithm augmented with virtual channels tolerate multiple fault regions. More specifically, we propose a mathematical model for this switching mechanism using Markov chain to calculate the probability of header message blocking and to capture the traffic rates on channels in the presence of faulty components. Simulation results based on the network topology confirm the validity of the analytical approximation and demonstrate the localizer efficiency.

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

Buying options

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. Dao, B.V., Duato, J., Yalamanchili, S.: Dynamically configurable message flow control for fault-tolerant routing. IEEE Transactions on Parallel and Distributed Systems 10(1), 7–22 (1999)

    Article  Google Scholar 

  2. Sueishi, M., Kitakami, M., Ito, H.: Fault-Tolerant Message Switching Based on Wormhole Switching and Backtracking. In: PRDC 2004. Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing, pp. 183–190. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  3. Xu, J.: Topological structure and analysis of interconnection networks. Kluwer Academic Publishers, Dordrecht (2001)

    MATH  Google Scholar 

  4. Safaei, F., et al.: Performance Analysis of Fault-Tolerant Routing Algorithm in Wormhole-Switched Interconnections. Journal of Supercomputing (2007)

    Google Scholar 

  5. Dally, W.J.: Virtual channel flow control. IEEE Transactions on Parallel and Distributed Systems 3(2), 194–205 (1992)

    Article  Google Scholar 

  6. Ould-Khaoua, M.: A performance model of Duato’s adaptive routing algorithm in k-ary n-cubes. IEEE Transactions on Computers 48(12), 1–8 (1999)

    Article  MathSciNet  Google Scholar 

  7. Agarwal, A.: Limits on interconnection network performance. IEEE Transactions on Parallel and Distributed Systems 2(4), 398–412 (1991)

    Article  Google Scholar 

  8. Draper, J.T., Ghosh, J.: A comprehensive analytical model for wormhole routing in multicomputer systems. Journal of Parallel and Distributed Computing 32(2), 202–214 (1994)

    Article  Google Scholar 

  9. Kleinrock, L.: Queuing Systems, vol. 1. John Wiley, New York (1975)

    Google Scholar 

  10. Feller, W.: An introduction to probability theory and its applications. John Wiley, New York (1967)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lynn Choi Yunheung Paek Sangyeun Cho

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Safaei, F., Khonsari, A., Fathy, M., Talebanfard, N., Ould-Khaoua, M. (2007). Generalized Wormhole Switching: A New Fault-Tolerant Mathematical Model for Adaptively Wormhole-Routed Interconnect Networks. In: Choi, L., Paek, Y., Cho, S. (eds) Advances in Computer Systems Architecture. ACSAC 2007. Lecture Notes in Computer Science, vol 4697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74309-5_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74309-5_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74308-8

  • Online ISBN: 978-3-540-74309-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics