Download:
|
by Honge Wang, Douglas M. Blough
http://www.eng.uci.edu./~hewang/papers/PDCS99/PDCS99.ps
Add To MetaCart
Abstract:
A tree-based multicast algorithm for wormholerouted torus networks, which makes use of multiple edge-disjoint spanning trees is presented. A technique for constructing two spanning trees in 2-dimensional torus networks is described. It is formally proven that this construction produces two edge-disjoint spanning trees in any 2-D torus network. Compared with an algorithm for construction of multiple edge-disjoint spanning trees in arbitrary networks, our construction produces significantly lower maximum and average path lengths. Finally, two approaches to providing single link fault tolerance with edge-disjoint spanning trees are presented and evaluated.
Citations
|
226
|
Optimum Broadcasting and Personalized Communication in Hypercubes
– Johnsson, Ho
- 1989
|
|
124
|
Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks,” Proc. 18th Int’l Symp
– Lin, Ni
|
|
30
|
Should Scalable Parallel Computers Support Efficient Hardware Multicast
– Ni
- 1995
|
|
17
|
Decomposition de la somme Cartesienne d’un cycle et de l’union de deus cycles Hamiltoniens en cycles Hamiltonians
– Aubert
- 1982
|
|
13
|
On Hamiltonian Circuits and Spanning Trees of Hypercubes
– Havel
- 1984
|
|
9
|
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies
– Libeskind-Hadas, Mazzoni, et al.
- 1997
|
|
8
|
A note on finding minimum-cost edge-disjoint spanning trees
– Roskind, E
- 1985
|
|
4
|
Tree-Based Multicast in Wormhole-Routed Torus Networks
– Wang, Blough
|
|
3
|
On Optimal Broadcasting in Faulty Hypercubes
– Bruck
- 1994
|
|
2
|
Decomposition into cycles I: Hamiltonian decomposition
– Alspach
- 1989
|
|
2
|
et al., "Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels
– Libeskind-Hadas
- 1996
|
|
2
|
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies
– al
- 1997
|
|
2
|
An Efficient Implementation of Tree-Based Multicast Routing for Distributed Shared-Memory Multiprocessors
– al
- 1996
|
|
2
|
Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme
– al
- 1994
|
|
2
|
Towards a simple construction for Hamiltonian decomposition of the Hypercube
– Song
- 1995
|
|
2
|
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels
– al
- 1996
|
|
1
|
On Edge-Disjoint Spanning Trees in Hypercubes
– Barden
- 1999
|
|
1
|
et al., "Multicasting protocols for highspeed, wormhole-routing local area networks
– Gerla
- 1996
|
|
1
|
Tree-Based Multicast in Wormhole- Routed Torus Networks
– Wang, Blough
|
