Proceedings of the 24th annual international symposium on Computer architecture
Asynchronous Tree-Based Multicasting in Wormhole-Switched MINs
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Architectural Support for Efficient Multicasting in Irregular Networks
IEEE Transactions on Parallel and Distributed Systems
Tree-Based Multicasting on Wormhole Routed Multistage Interconnection Networks
ICPP '97 Proceedings of the international Conference on Parallel Processing
A Reliable Hardware Barrier Synchronization Scheme
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Multicasting on Switch-Based Irregular Networks Using Multi-drop Path-Based Multidestination Worms
PCRCW '97 Proceedings of the Second International Workshop on Parallel Computer Routing and Communication
Collective communication patterns on the quadrics network
Performance analysis and grid computing
Hardware supported multicast in fat-tree-based InfiniBand networks
The Journal of Supercomputing
Power-efficient tree-based multicast support for networks-on-chip
Proceedings of the 16th Asia and South Pacific Design Automation Conference
Hi-index | 0.00 |
This paper proposes a new approach for implementing fast multicast and broadcast in multistage interconnection networks (MINs) with multiport encoded multidestination worms. For a MIN with k x k switches and n stages such worms use n header flits each. One flit is used for each stage of the network and it indicates the output ports to which a multicast message must be replicated. A single multiport encoded worm has the capability to cover a large number of destinations with a single communication startup. A switch architecture is proposed for implementing multidestination worms without deadlock. Grouping algorithms of varying complexity are presented to derive the associated multiport encoded worms for a multicast to an arbitrary set of destinations. Using these worms a multinomial tree-based scheme is proposed to implement the multicast. This approach significantly reduces broadcast/multicast latency compared to schemes using unicast messages. Simulation studies indicate that improvement in broadcast/multicast latency up to a factor of 4 is feasible using the new approach. Interestingly, this approach is able to implement multicast with reduced latency as the number of destinations increases beyond a certain number.