Tree-based multicasting in wormhole-routed irregular topologies

• Published in: Proceedings - International Parallel Processing Symposium pp. 244 - 249
• Main Authors: Libeskind-Hadas, R., Mazzoni, D., Rajagopalan, R.
• Format: Conference Proceeding Journal Article
• Language: English
• Published: IEEE 1998
• Subjects: Communication switching; Delay; Hardware; Multicast algorithms; Multicast communication; Network topology; Routing; Switches; Synchronization; System recovery
• ISBN: 0818684046; 9780818684043
• ISSN: 1063-7133
• DOI: 10.1109/IPPS.1998.669919

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 start up 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.