Turn Grouping for Multicast in Wormhole-Routed Mesh Networks Supporting the Turn Model

Authors:
Kuo-Pao Fan;Chung-Ta King
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.king@cs.nthu.edu.tw
Venue:
The Journal of Supercomputing
Year:
2000

Citing 10
Cited 3

Multicast in hypercube multiprocessors

Journal of Parallel and Distributed Computing
Deadlock-free multicast wormhole routing in multicomputer networks

ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
The turn model for adaptive routing

ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
ComPaSS: efficient communication services for scalable architectures

Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Unicast-Based Multicast Communication in Wormhole-Routed Networks

IEEE Transactions on Parallel and Distributed Systems
Designing Clustered Multiprocessor Systems under Packaging and Technological Advancements

IEEE Transactions on Parallel and Distributed Systems
Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths

IEEE Transactions on Parallel and Distributed Systems
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Adaptive Multicast Wormhole Routing in 2D Mesh Multicomputers

PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
An Efficient Implementation of Tree-Based Multicast Routing for Distributed Shared-Memory Multiprocessors

SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)

Dual-tree-based multicasting on wormhole-routed irregular switch-based networks

Journal of Systems Architecture: the EUROMICRO Journal
Multipath-Based Multicasting Strategies for Wormhole-Routed Star Graph Interconnection Networks

The Journal of Supercomputing
An Efficient Tree-Based Multicasting Algorithm on Wormhole-Routed Star Graph Interconnection Networks Embedded with Hamiltonian Path

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multicast is an important collective communication in scalable parallel computers. One efficient scheme to perform multicast is multidestination messaging[8]. In multidestination messaging, destination nodes of a multicast are partitioned into disjoint groups. Nodes in each group are reached with a multidestination message that conforms to the base routing algorithm of the system. A systematic way of partitioning the nodes is critical to the efficiency of multidestination messaging. In this paper we propose a node grouping method, called turn grouping, for partitioning the destination nodes in a multicast. Turn grouping is general in the sense that it supports any base routing algorithm derivable from the turn model [5]. Given such a base routing algorithm and the corresponding prohibited turns, turn grouping can systematically produce a proper schedule for multicasting the message. We evaluated the performance of turn grouping using three typical turn model-based routing algorithms. The simulation results show that our approach performs better than the Umesh [12] and the Hamiltonian-path [8] algorithms.