Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Optimal software multicast in wormhole-routed multistage networks
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Optimal Multicast Communication in Wormhole-Routed Torus Networks
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Broadcasting, multicasting and gossiping in trees under the all-port line model
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
| Hi-index | 0.00 |
In this paper, we give a general technique for computing optimal multicast calling schedules in any multiprocessor system that utilizes a direct network interconnection structure as long as a few simple conditions are satisfied. Since almost any real system will satisfy these conditions, this result essentially means that multicast can always be performed in the ceiling of log (d+1) phases, where d is the number of multicast destinations. In particular, previous results on optimal multicast algorithms in specific direct network topologies \cite{far80,mck92,rob94} are simply corollaries of our result.