Research Output

Towards optimal broadcasting in wormhole-routed meshes.

  Most existing broadcast algorithms proposed for the mesh do not scale well with the network size.
Furthermore, they have been mainly based on deterministic routing, which cannot exploit the alternative
paths provided by mesh topology to reduce communication latency. Motivated by these observations, this
paper introduces a new adaptive broadcast algorithm for the mesh based on the coded path routing
approach. The unique feature of the new algorithm is its ability to handle broadcast operations with only
two message-passing steps irrespective of the network size. Results from a comparative analysis reveal that
the proposed algorithm exhibits superior performance characteristics over those of the well-known
Recursive Doubling, Extending Dominating Node and Network Partitioning algorithms.

  • Date:

    30 November 2000

  • Publication Status:

    Published

  • Publisher

    Computer Science Research, Education, and Applications Press

Citation

Al-Dubai, A., Ould-Khaoua, M. & Mackenzie, L. (2000). Towards optimal broadcasting in wormhole-routed meshes. In PDPTA -INTERNATIONAL CONFERENCE: Parallel and distributed processing techniques and applications, 1121-1127. ISBN 1892512696

Authors

Keywords

Mesh; Broadcast; Wormhole Switching; Adaptive Routing; Communication Latency; Performance Analysis;

Available Documents