Optimal multicast communication in wormhole-routed torus networks
Conference
·
OSTI ID:98894
- Michigan State Univ., East Lansing, MI (United States)
This paper presents efficient algorithms that implement one-to-many, or multicast, communication in wormhole-routed torus networks. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm 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 a simulation study on torus networks are also given.
- DOE Contract Number:
- FG02-93ER25167
- OSTI ID:
- 98894
- Report Number(s):
- CONF-940856--; CNN: Grant CDA-9121641; Grant MIP-9204066; Grant CDA-9222901; Grant CCR-9209873
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimal software multicast in wormhole-routed multistage networks
Efficient collective data distribution in all-port wormhole-routed hypercubes
Multicast communication in distributed algorithms
Book
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87671
Efficient collective data distribution in all-port wormhole-routed hypercubes
Conference
·
Thu Dec 30 23:00:00 EST 1993
·
OSTI ID:46273
Multicast communication in distributed algorithms
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5563509