A Distributed Multicast Algorithm for Hypercube Multicomputers

This paper proposes a novel distributed multicast algo rithm for hypercubes. Based on our algorithm, any node in a multicast-set can directly initiate a multicast to other nodes in the same set. The Dimension-PArtition Tech nique (DIPAT) is the underlying message routing tech nique. This routing technique is valid only for certain con nected graphs, called DIPAT-graphs whose necessary and sufficient conditions are derived. A heuristic algorithm is developed for construction of DIPAT-graphs. In addition, DIP AT is integrated with a simple spanning tree algorithm to form a hierarchical multicasting graph, which retains a higher level of distributed multicasting capability with a similar level of extra traffic as that of the existing single spanning tree based solutions.

[1]  Hong Xu,et al.  Efficient implementation of barrier synchronization in wormhole-routed hypercube multicomputers , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[2]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

[3]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[4]  Ming-Syan Chen,et al.  Adaptive Fault-Tolerant Routing in Hypercube Multicomputers , 1990, IEEE Trans. Computers.

[5]  Larry D. Wittie,et al.  Multicast Communication on Network Computers , 1985, IEEE Software.

[6]  Lionel M. Ni,et al.  Multicast in Hypercube Multiprocessors , 1990, J. Parallel Distributed Comput..

[7]  Jang-Ping Sheu,et al.  A Multicast Algorithm for Hypercube Multiprocessors , 1994, Parallel Algorithms Appl..

[8]  Xiaola Lin,et al.  Multicast Communication in Multicomputer Networks , 1993, ICPP.