Skip to main content
SpringerLink
Log in

Fault-tolerant broadcasting in toroidal networks

  • Workshop on Fault-Tolerant Paralland Distribution Systems Dimiter Avresky, Boston University David R. Kaeli, Northeastern University
  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1388))

Included in the following conference series:

Abstract

A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to (2n-2) node failures. Compared to the optimal algorithm in a fault-free k-ary n-cube, the proposed algorithm requires at most 3 extra communication steps in the case of cut through packet routing and (n + 1) extra steps in the case of store-and-forward routing. Conditions under which this algorithm works correctly in a general toroidal network are given.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Al-Dhelaan and B. Bose. “An Efficient Fault-Tolerant Broadcasting Algorithm for the Hypercube”. In 4th Conference on Hypercube Concurrent Computers and Applications, pages 123–128, 1989.

    Google Scholar 

  2. R. Alverson, D. Callahan, D. Cummings, B. Koblenz, A. Porterfield, B. Smith. “The Tera Computer System”. Technical report, Tera Computer Company, 1991.

    Google Scholar 

  3. B. Bose, R. Broeg, Y. Kwon, and Y. Ashir. “Lee Distance and Topological Properties of k-ary n-cubes”. IEEE Transactions on Computers, 44(8):1021–1030, August 1995.

    Article  Google Scholar 

  4. R. Broeg and B. Bose. “Fault-Tolerant Broadcasting in A k-ary n-cube”. In Annual IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems, 1996. Chapter 15 of Fault-Tolerant Parallel and Distributed Systems, to be published by Kluwer Academic Publishers, Boston.

    Google Scholar 

  5. W. Dally. “Performance Analysis of k-ary n-cube Interconnection Networks”. IEEE Transaction on Computers, 39(6):775–785, June 1990.

    Article  Google Scholar 

  6. W. Dally and C. Seitz. “The Torus Routing Chip”. Journal of Distributed Computing, 1(3):187–196, 1986.

    Google Scholar 

  7. W. Dally and C. Seitz. “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks”. IEEE Transaction on Computers, 36(5):547–553, May 1987.

    Google Scholar 

  8. J. Draper and J. Ghosh. “Multipath E-cube Algorithms (MECA) for Adaptive Wormhole Routing and Broadcasting in k-ary n-cube”. In 6 th International Parallel Processing Symposium, pages 407–410, March 1992.

    Google Scholar 

  9. S. Johnson and C. Ho. “Optimum Broadcasting and Personalized Communication in Hypercubes”. IEEE Transactions on Computers, 38(9):1249–1268, September 1989.

    Article  Google Scholar 

  10. P. Kermani and L. Kleinrock. “Virtual Cut-Through: A New Communication Switching Technique”. Computer Networks, 3(4):267–286, 1979.

    Article  Google Scholar 

  11. S. Lam. “Store-and-Forward Buffer Requirements in a Packet Switching Network”. IEEE Transactions on Communications, COM-24(4):394–403, April 1976.

    Article  Google Scholar 

  12. T. Chiang Lee and J. Hayes. “A Fault-Tolerant Communication Scheme for Hypercube Computers”. IEEE Transactions on Computers, 41(10):1242–1256, October 1992.

    Article  Google Scholar 

  13. L. Ni and McKinley. “A Survey of Wormhole Routing Techniques in Direct Connect Networks”. IEEE Computer, 26(2):62–76, February 1993.

    Google Scholar 

  14. W. Oed. “Massively Parallel Processor System CRAY T3D”. Technical report, Cray Research GmbH, November 1993.

    Google Scholar 

  15. S. Park and B. Bose. “Broadcasting in Hypercubes with Link/Node Failures”. In 4th Symposium on the Frontiers of Massively Parallel Computation, pages 286–290, 1992.

    Google Scholar 

  16. S. Park and B. Bose. “All-to-All Broadcasting in Faulty Hypercubes”. IEEE Transactions on Computers, 46(7):749–755, July 1997.

    Article  Google Scholar 

  17. S. Park, B. Bose, and R. Broeg. “Algorithms for Broadcasting in Faulty Hypercubes”. In 6 th International Conference on Parallel and Distributed Computing Systems, pages 361–366, October 1993.

    Google Scholar 

  18. S. Scott and G. Thorson. “The Cray T3E Network: Adaptive Routing in High Performance 3D Torus”. In HOT Interconnects IV, Stanford University, August 15–16 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Kuwait University, P.O. Box 5969, 13060, Safat, Kuwait

    Bader Almohammad

  2. Department of Computer Science, Oregon State University, 97331, Corvallis, OR, USA

    Bella Bose

Authors
  1. Bader Almohammad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bella Bose
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Almohammad, B., Bose, B. (1998). Fault-tolerant broadcasting in toroidal networks. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_735

Download citation

  • DOI: https://doi.org/10.1007/3-540-64359-1_735

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64359-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation