Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Sufficient Conditions for Optimal Multicast Communication
ICPP '97 Proceedings of the international Conference on Parallel Processing
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Multicast on Irregular Switch-based Networks with Wormhole Routing
HPCA '97 Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture
Optimal Multicast Communication in Wormhole-Routed Torus Networks
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Architectural Support for Efficient Multicasting in Irregular Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient Multicast on Irregular Switch-Based Cut-Through Networks with Up-Down Routing
IEEE Transactions on Parallel and Distributed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Efficient Multicast Algorithms for Heterogeneous Switch-based Irregular Networks of Workstations
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Dynamic load balancing for switch-based networks
Journal of Parallel and Distributed Computing
The Journal of Supercomputing
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing
Efficient broadcast in heterogeneous networks of workstations using two sub-networks
International Journal of Parallel Programming
A Message Scheduling Scheme for All-to-All Personalized Communication on Ethernet Switched Clusters
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switch-based networks of workstations. The algorithm is optimal with respect to the number of startups incurred and is provably free from depth contention. Specifically, no two constituent unicasts for the same multicast contend for a common channel, even if some unicasts are delayed due to unpredictable variations in latencies. The algorithm uses an underlying partially adaptive deadlock-free unicast routing algorithm. Simulation results indicate that the algorithm behaves as predicted by its theoretical properties and provides a promising approach to unicast-based multicasting.