Efficient multicast communication in multidestination wormhole-routed mesh networks

In this paper, vie propose two proximity grouping schemes for efficient multicast in wormhole-routed mesh networks with multidestination capability. The first grouping scheme, graph-based proximity grouping, is proposed to group, the destinations with locality together to form several disjoint sub-meshes by modeling the proximity grouping problem to graph partitioning problem. The second one, pattern-based proximity grouping, is proposed by the pattern classification schemes to achieve the goal of the proximity grouping. By exploiting the spatial locality of the destination set, we can efficiently perform the multicast in wormhole-routed mesh networks conforming to the Hamiltonian-path routing scheme via experimental results.