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:

    01 January 2001

  • Publication Status:


  • Publisher

    Computer Science Research, Education, and Applications Press

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    005 Computer programming, programs & data


Al-Dubai, A., Ould-Khaoua, M., & Mackenzie, L. (2000). Towards optimal broadcasting in wormhole-routed meshes. In H. R. Arabnia (Ed.), Proceedings of the international conference on parallel and distributed processing techniques and applications : PDPTA'2001, 1121-1128



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

Monthly Views:

Available Documents