Broadcasting on Meshes with Worm-Hole Routing

Authors:
Michael Barnett;David G. Payne;Robert A. van de Geijn;Jerrell Watts
Affiliations:
-;-;-;-
Venue:
Broadcasting on Meshes with Worm-Hole Routing
Year:
1993

Citing 0
Cited 3

Collective Communication in Wormhole-Routed Massively Parallel Computers

Computer
Architecture-Dependent Tuning of the Parameterized Communication Model for Optimal Multicasting

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Improving communication performance in dense linear algebra via topology aware collectives

Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of broadcasting on mesh architectures with arbitrary (non-power-two) dimensions. It is assumed that such mesh architectures employ cut-through or worm-hole routing. The main results are an algorithm for performing an optimal minimum-spanning tree broadcast when messages are not pipelined, a pipelined algorithm that is similar to Ho and Johnson''s EDST algorithm for hypercubes, and a novel scatter-collect approach that is a natural choice for communication libraries due to its simplicity. Results obtained on the Intel Touchstone Delta system are included.