Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported multicast services can potentially offer improved performance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement multicast communication in wormhole-routed direct networks, in the absence of hardware multicast support, by exploiting the properties of the switching technology. Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages. Both algorithms can deliver a multicast message to m-1 destinations in [log/sub 2/ m] message passing steps, while avoiding contention among the constituent unicast messages. Performance results of implementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-D mesh are given.
展开▼
机译：在并行计算中，越来越需要多播通信，在该多播通信中，相同的消息从源节点传递到任意数量的目的节点。系统支持的多播服务可以潜在地提供改进的性能，增强的功能和简化的编程，并且可以依次用于支持各种更高级别的数据移动和全局过程控制操作。本文提出了一种有效的算法，通过利用交换技术的特性，在没有硬件多播支持的情况下，在虫洞路由直接网络中实现多播通信。针对使用确定性，按维度排序的单播消息路由的n维网格和超立方体，提出了最短时间组播算法。两种算法都可以在[log / sub 2 / m]消息传递步骤中将多播消息传递到m-1个目的地，同时避免构成单播消息之间的争用。给出了在64节点nCUBE-2超立方体和168节点Symult 2010 2-D网格上实现的性能结果。
展开▼
