Journal of Computer Science and Technology

, Volume 16, Issue 5, pp 393–409 | Cite as

Fault-tolerant tree-based multicasting in mesh multicomputers

  • Wu Jie 
  • Chen Xiao 
Regular Paper


We propose a fault-tolerant tree-based multicast algorithm for 2-dimensional (2-D) meshes based on the concept of the extended safety level which is a vector associated with each node to capture fault information in the neighborhood. In this approach each destination is reached through a minimum number of hops. In order to minimize the total number of traffic steps, three heuristic strategies are proposed. This approach can be easily implemented by pipelined circuit switching (PCS). A simulation study is conducted to measure the total number of traffic steps under different strategies. Our approach is the first attempt to address the fault-tolerant tree-based multicast problem in 2-D meshes based on limited global information with a simple model and succinct information.


fault tolerance faulty block mesh minimal routing multicast pipelined circuit switching (PCS) safety level 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Pacheco P. Parallel Programming with MPI. Morgan Kaufmann Publishers, 1997.Google Scholar
  2. [2]
    Boura Y M, Das C R. Fault-tolerant routing in mesh networks. InProc. 1995 International Conference, on Parallel Processing, 1995, 1: 106–109.Google Scholar
  3. [3]
    Boppana R V, Chalasani S. Fault tolerant wormhole routing algorithms for mesh networks.IEEE Transactions on Computers, July, 1995, 44(7): 848–864.MATHCrossRefGoogle Scholar
  4. [4]
    Lin X, Ni L M. Multicast communication in multicomputer networks.IEEE Transactions on Parallel and Distributed Systems Oct., 1993, 4(10): 1105–1117CrossRefGoogle Scholar
  5. [5]
    Panda D K. Issues in designing efficient and practical algorithms for collective communication on wormhole-routed systems. InProc. the 1995 ICPP Workshop on Challenges for Parallel Processing, Aug., 1995, pp.8–15.Google Scholar
  6. [6]
    Lin X, McKinley P, Ni L M. Deadlock-free multicast wormhole routing in 2D-mesh multicomputers.IEEE Transactions on Parallel and Distributed Systems Aug., 1994, 5: 793–804.CrossRefGoogle Scholar
  7. [7]
    Panda D K, Singal S, Prabhakaran P. Multidestination message passing mechanism conforming to base wormhole routing scheme. InProceedings of the Parallel Computer Routing and Communication Workshop, LNCS 853, 1994, pp.131–145.Google Scholar
  8. [8]
    Qiao W, Ni L M. Adaptive routing in irregular networks using cut-through switches. InProc. the 1996 International Conference on Parallel Processing, Aug., 1996, I 52-I 60.Google Scholar
  9. [9]
    Tseng Y C, Yang M H, Juang T Y. An Euler-path-based multicasting model for wormhole-routed networks with multi-destintion capability. InProc. 1998 Int Conf. Parallel Processing Aug, 1998, pp.366–373.Google Scholar
  10. [10]
    Libeskind-Hadas R, Mazzoni D, Rajagopalan R. Tree-based multicasting in wormhole routed irregular topologies. InProc. the First IPPS/SPDP, April, 1998, pp.244–249.Google Scholar
  11. [11]
    Malumbres M P, Duato J, Torrellas J. An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors. InProc. Eighth IEEE Symp. on Parallel and Distributed Processing, Oct., 1996, pp.186–189.Google Scholar
  12. [12]
    Ni L M. Should scalable parallel computers support efficient hardware multicast? InProc. the 1995 ICPP Workshop on Challenges for Parallel Processing, 1995, pp.2–7.Google Scholar
  13. [13]
    Schroeder M,et al. Autonet: A high-speed, self-configuration local area netowrk using point-to-point links.IEEE Journal of Selected Areas in Communications, Oct., 1991, 9(10): 1318–1335.CrossRefGoogle Scholar
  14. [14]
    Sivaram R, Panda D K, Stunkel C. Multicasting in irregular networks with cut-through switches using tree-based multidestination worms. InProc. the 2nd Parallel Computing, Routing, and Communication Workshop, June, 1997.Google Scholar
  15. [15]
    Gaughan P T, Yalamanchili S. A family of fault-tolerant routing protocols for direct multiprocessor networks.IEEE Transactions on Parallel and Distributed Systems, May, 1995, 6(5): 482–495.CrossRefGoogle Scholar
  16. [16]
    Wang H, Blough D. Tree-based fault-tolerant multicast in multicomputer networks using pipelined circuit switching. Department of Electrical and Computer Engineering, University of California, Irvine Technical Report ECE 97-05-01, May, 1997.Google Scholar
  17. [17]
    Chien A A, Kim J H Planar-adaptive routing: Low cost adaptive networks for multiprocessors. InProc. the 19th International Symposium on Computer Architecture, 1992, pp.268–277.Google Scholar
  18. [18]
    Libeskind-Hadas R, Brandt E. Origin-based fault-tolerant routing in the mesh.Future Generation Computer Systems, Oct., 1995, 11(6): 603–615.CrossRefGoogle Scholar
  19. [19]
    Su C C, Shin K G. Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes.IEEE Transactions on Computers, June, 1996, 45(6): 672–683.Google Scholar
  20. [20]
    Wu J. Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels. InProc. the 18th International Conf. Distributed Computing Systems, May, 1998, pp.428–435.Google Scholar
  21. [21]
    Lan Y, Esfahanian A H, Ni L M. Distributed multi-destination routing in hypercube multiprocessors. InProc. the 3rd Conference on Hypercube Concurrent Computers and Applications, 1988, 1: 631–639.Google Scholar
  22. [22]
    Harary F. Graph Theory. Readings, MA: Addison-Wesley, 1972.Google Scholar
  23. [23]
    Fleury E, Fraigniaud P. Multicasting in meshes. InProc. the 1994 International Conference on Parallel Processing, 1994, III 151-III. 158.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2001

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringFlorida Atlantic UniversityBoca RatonUSA
  2. 2.Computer Science DepartmentSouthwest Texas State UniversitySan MarcosUSA

Personalised recommendations