Broadcasting on Meshes with Wormhole Routing

We address the problem of broadcasting on two-dimensional mesh architectures with an arbitrary (non-power-of-two) number of nodes in each dimension. It is assumed that such mesh architectures employ cut-through or wormhole routing. The primary focus is on avoiding network conflicts in the various pr...

Full description

Saved in:
Bibliographic Details
Published inJournal of parallel and distributed computing Vol. 35; no. 2; pp. 111 - 122
Main Authors Barnett, Mike, Payne, David G., van de Geijn, Robert A., Watts, Jerrell
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 15.06.1996
Elsevier
Subjects
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Interconnected networks
Networks and services in france and abroad
Software
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Supercomputer
Wormhole
Meshed network
Conflict
Network analysis
Spanning tree
Broadcasting
Routing
Two dimensional analysis
Pipeline
Online AccessGet full text

Cover

More Information
Summary:We address the problem of broadcasting on two-dimensional mesh architectures with an arbitrary (non-power-of-two) number of nodes in each dimension. It is assumed that such mesh architectures employ cut-through or wormhole routing. The primary focus is on avoiding network conflicts in the various proposed algorithms. We give algorithms for performing a conflict-free minimum-spanning tree broadcast, a pipelined algorithm that is similar to Ho and Johnsson's EDST algorithm for hypercubes, and a novelscatter–collectapproach that is a natural choice for communication libraries due to its simplicity. Results obtained on the Intel Paragon system are included.
ISSN:0743-7315
1096-0848
DOI:10.1006/jpdc.1996.0074