Download:
|
by Ram Kesavan, Kiran Bondalapati, Dhabaleswar K. P
In Proceedings of the International Symposium on High Performance Computer Architecture (HPCA-3
ftp://ftp.cis.ohio-state.edu/pub/communication/papers/hpca97-multicast-irreg.ps.Z
Add To MetaCart
Abstract:
Abstract: This paper presents efficient multicasting with reduced contention on irregular networks with switchbased wormhole interconnection and unicast message passing. First, it is proved that for an arbitrary irregular network with a typical deadlock-free, adaptive routing, it may not be possible to create an ordered list of nodes to implement an arbitrary multicast in a contention-free manner with minimal number of communication steps. Next, three different multicast algorithms are proposed with their respective node orderings to reduce contention: switchbased ordering (SO), switch-based hierarchical ordering (SHO), and chain concatenation ordering (CCO). A variation of a binomial tree-based communication pattern with unicast message passing is used on the above ordered lists to implement multicast. The proposed multicast algorithms are compared with each other as well as with the naive random ordering (RO) algorithm for a range of system sizes, switch sizes, message lengths, degrees of connectivity, destination set sizes, and communication start-up times. The CCO algorithm is shown to be the best to implement multicast with reduced contention and minimum latency. Such results related to multicast on irregular networks are the first of their kind in the wormhole literature. Thus, these results demonstrate significant potential to be applied to current and future generation NOW systems with irregular interconnection.
Citations
|
784
|
Myrinet: A Gigabit-per-second Local Area Network
– Boden, Cohen, et al.
- 1995
|
|
423
|
A Survey of Wormhole Routing Techniques in Direct Networks
– Ni, McKinley
- 1993
|
|
291
|
High Performance Messaging on Workstations: Illinois Fast Messages (FM) for Myrinet
– Pakin, Lauria, et al.
- 1995
|
|
226
|
Optimum Broadcasting and Personalized Communication in Hypercubes
– Johnsson, Ho
- 1989
|
|
155
|
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
– Duato
- 1993
|
|
137
|
The J-Machine multicomputer: an architectural evaluation
– Noakes, Wallach, et al.
- 1993
|
|
124
|
Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks,” Proc. 18th Int’l Symp
– Lin, Ni
|
|
121
|
Unicast-Based Multicast Communication in WormholeRoutedNetworks
– McKinley
- 1992
|
|
93
|
Collective Communication in Wormhole-Routed Massively Parallel
– McKinley, Tsai, et al.
- 1995
|
|
83
|
1995]. Distributed Network Computing over Local ATM Networks
– Lin, Hsieh, et al.
|
|
64
|
Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme
– Panda, Singal, et al.
- 1994
|
|
57
|
Efficient reliable multicast on Myrinet
– Verstoep, Langendoen, et al.
- 1996
|
|
50
|
Efficient support for multicomputing on ATM networks
– Thekkath, Levy, et al.
- 1993
|
|
45
|
et al. Autonet: a high-speed, self-configuring local area network using point-to-point links
– Schroeder
|
|
45
|
Ni,ªAdaptive Routing in Irregular Networks Using Cut-Through Switches,º
– Qiao, M
- 1996
|
|
44
|
Muhicast in Hypercube Multiprocessor s
– 13sfahanian, Ni
- 1990
|
|
34
|
On Multicast Wormhole Routing in Multicomputer Networks
– Boppana, Chalasani, et al.
- 1994
|
|
32
|
ServerNet Deadlock Avoidance and Fractahedral Topologies
– Horst
- 1996
|
|
32
|
Issues in Designing Efficient and Practical Algorithms for Collective Communication in Wormhole-Routed Systems
– Panda
- 1995
|
|
26
|
A theory of deadlock-free adaptive multicast routing in wormhole networks
– Duato
- 1995
|
|
26
|
An Overview of the Ncube-3 Supercomputer
– Duzett, Buck
- 1992
|
|
25
|
Minimizing node contention in multiple multicast on wormhole k-ary n-cube networks
– Kesavan, Panda
- 1996
|
|
24
|
Efficient Multi-Packet Multicast Algorithms on Meshes with Wormhole and Dimension-Ordered Routing
– Coster, Dewulf, et al.
- 1995
|
|
23
|
Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Path
– Panda, Singal, et al.
- 1999
|
|
18
|
Multiple message broadcasting in the postal model
– Bar-Noy, Kipnis
- 1993
|
|
17
|
Multiple message broadcasting with generalized Fibonacci trees
– Bruck, Cypher, et al.
- 1992
|
|
14
|
A Thread-Based Interface for Collective Communication on ATM Networks
– Huang, Huang, et al.
- 1995
|
|
13
|
Multicast Virtual Topologies for Collective Communication in MPCs and ATM Clusters
– Huang, Huang, et al.
- 1995
|
|
9
|
CSIM Reference Manual (Revision 13
– Schwetman
- 1989
|
|
3
|
Generic Methodologies for Deadlock-free Routing
– Park, Agrawal
- 1996
|
|
2
|
The performance impact of flexibility in the stanford flash multiprocessor
– al
- 1994
|
