Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 24th annual international symposium on Computer architecture
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Nonblocking k-Fold Multicast Networks
IEEE Transactions on Parallel and Distributed Systems
A Fast Tree-Based Barrier Synchroization on Switch-Based Irregular Networks
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Nonblocking k-Fold Multicast Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Constructing Edge-Disjoint Spanning Trees in Product Networks
IEEE Transactions on Parallel and Distributed Systems
Deadlock-free multicasting in irregular networks using prefix routing
The Journal of Supercomputing
| Hi-index | 0.00 |
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number of destinations using only a single startup phase. In contrast to existing tree-based schemes, this algorithm applies to all interconnection topologies, requires only fixed-sized input buffers that are independent of maximum message length, and uses a simple asynchronous flit replication mechanism. The theoretical basis of the technique used here is sufficiently general to develop other tree-based multicasting algorithms for regular and irregular topologies. Simulation results demonstrate that this tree- based algorithm provides a very promising means of achieving very low latency multicast.