Skip to main content
Log in

Fault-Tolerant Broadcasting in 2-D Wormhole-Routed Meshes

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In this paper, a fault-tolerant broadcast scheme in 2-D meshes with randomly generated faults is provided. This approach is based on an early work on time-step optimal broadcasting in square-shape fault-free 2-D meshes with optimal total communication distance (TCD). An extension to any rectangular-shape fault-free 2-D meshes is first given. The fault block model is used in which all faulty nodes in the system are contained in a set of disjoint blocks. The boundary lines of blocks divide the whole mesh into a set of fault-free polygons and a sequence of rectangular fault-free regions is derived from these polygons. The broadcast process is carried out at two levels: inter-region and intra-region. In the inter-region-level broadcast, the broadcast message is sent from a given source to a special node (called eye [1]) in each rectangular fault-free region. In the intra-region-level broadcast, the extended optimal fault-free broadcast is applied. Some analytical results are given including an upper bound of TCD.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Cang and J. Wu. Minimizing total communication distance of a time-step optimal broadcast in mesh network. Proc. of the First Merged IPPS/SPDP 1998, pp. 10–17, April 1998.

  2. S. Cang and J. Wu. Time-Step optimal broadcasting in 3D meshes with minimum total communication distance. Journal of Parallel and Distributed Computing, 60:966–997, 2000.

    Google Scholar 

  3. S. Cang and J. Wu. Minimizing total communication distance (TCD) of a time-step optimal broadcast in a dD mesh. Department Technical Reports, TR-CSE-99-15, Florida Atlantic University, 1999.

    Google Scholar 

  4. W. J. Dally, The J-machine: System support for actors. In Hewitt and Agha, eds., Actors: Knowledgebased Concurrent Computing, MIT Press, 1989.

  5. J. Duato, S. Yalmanchili, and L. Ni. An Engineering Approach, IEEE Computer Society, 1997.

  6. Z. Jiang and J. Wu. Fault-tolerant broadcasting in 2-D wormhole-routed meshes. The 2001 International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, NV, pp. 2028–2034, June 2001.

  7. S. L. Johnsson and C. T. Ho. Optimal broadcasting and personalized communication in hypercubes. IEEE Trans. Computer, 38(9):1249–1268, September 1989.

    Google Scholar 

  8. S. L. Lamport, R. Shostak, and M. Pease, The byzantine generals problems. ACM Trans. Progr. Languages Systems, pp. 633–639, June 1992.

  9. X. Lin, and L. M. Ni. Multicast communication in multicomputers networks. IEEE Transactions on Parallel and Distributed Systems, 4(10):1105–1117, October 1993.

    Google Scholar 

  10. P. A. Nelson and L. Snyder. Programming paradigms for nonshared memory parallel computers. In L. H. Jamieson, et al., eds., The Characteristics of Parallel Algorithms, Vol. 1, MIT Press, Cambridge, MA. 346–354, 1987.

    Google Scholar 

  11. L. M. Ni, and P. K. Mckinley. A survey of wormhole routing techniques in direct networks. Computer, pp. 62–76, February 1993.

  12. D. K. Panda. Issues in designing efficient and practical algorithms for collective communication on wormhole routed system. Proceedings of the 1995 ICPP Workshop on Challenges for Parallel Processing, pp. 8–15, August 1995.

  13. J. Y. L. Park, H. A. Choi, N. Nupairoj, and L. M. Ni. Construction of optimal multicast trees based on the parameterized communication model. Proc. of the International Conference on Parallel Processing, pp. 180–187, August 1996.

  14. P. Ramanathan, K. G. Shin, and R. W. Butler. Fault-tolerant clock synchronization in distributed systems. Computer, 23:33–42, October 1990.

    Google Scholar 

  15. S. Park, S. Seidel, and J. Youn. Fault-tolerant broadcasting in wormhole-routed torus networks. International Parallel and Distributed Processing Symposium (IPDPS), April 2002.

  16. J. Wu. Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels. IEEE Transactions Parallel and Distributed Systems, 11(2):149–159, February 2000.

    Google Scholar 

  17. J. Wu. A distributed formation of orthogonal convex polygons in mesh-connected multicomputers. Proceedings of International Parallel and Distributed Processing Symposium (IPDPS), April 2001.

  18. X. Zhuang and V. Liberatore. A recursion-based broadcast paradigm in wormhole routed mesh/torus networks. Parallel and Distributed Processing Symposium, Proceedings International, IPDPS 2002

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jiang, Z., Wu, J. Fault-Tolerant Broadcasting in 2-D Wormhole-Routed Meshes. The Journal of Supercomputing 25, 255–275 (2003). https://doi.org/10.1023/A:1024251227948

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024251227948

Navigation