Research Output

An efficient adaptive broadcast algorithm for the mesh network

  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. The unique feature of our algorithm is its ability to handle broadcast operations with only two message-passing steps irrespective of the network size. Results from extensive comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.

  • Date:

    30 November 2000

  • Publication Status:

    Published

  • Publisher

    IEEE Computer Society

  • DOI:

    10.1109/ICPADS.2001.934805

  • Library of Congress:

    QA75 Electronic computers. Computer science

Citation

Al-Dubai, A. & Ould-Khaoua, M. (2000). An efficient adaptive broadcast algorithm for the mesh network. In Eighth International Conference on Parallel and Distributed Systems (ICPADS'01), 83-90. doi:10.1109/ICPADS.2001.934805. ISBN 0-7695-1153-8

Authors

Keywords

Broadcast algorithm; mesh; deterministic routing; recursive doubling;extending dominating node algorithms;

Available Documents