New Orleans, LA
Oct. 23, 1996 to Oct. 26, 1996
Rajeev Sivaram , The Ohio State University
Dhabaleswar K. Panda , The Ohio State University
Craig B. Stunkel , I.B.M. T.J. Watson Research Center
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.
Parallel architectures, multistage interconnection networks, interprocessor communication, collective communication, broadcast, multicast, wormhole routing, and virtual cut-through
Rajeev Sivaram, Dhabaleswar K. Panda, Craig B. Stunkel, "Efficient Broadcast and Multicast on Multistage Interconnnection Networks using Multiport Encoding", SPDP, 1996, Parallel and Distributed Processing, IEEE Symposium on, Parallel and Distributed Processing, IEEE Symposium on 1996, pp. 36, doi:10.1109/SPDP.1996.570314