Research Output

A scalable broadcast algorithm for multiport meshes with minimum communication steps

  Many broadcast algorithms have been proposed for the mesh over the past decade. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by these observations, this study proposes a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is that it handles broadcast operations with a fixed number of message passing steps irrespective of the network size. Our algorithm is based on the coded path routing, which has been proposed in (Al-Dubai and Ould-Khaous, 2001). 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 2001

  • Publication Status:

    Published

  • Publisher

    IEEE Computer Society

  • DOI:

    10.1109/ICPADS.2002.1183400

  • Library of Congress:

    QA75 Electronic computers. Computer science

Citation

Al-Dubai, A., Ould-Khaoua, M. & Mackenzie, L. (2001). A scalable broadcast algorithm for multiport meshes with minimum communication steps. In Proceedings of the Ninth International Conference on Parallel and Distributed Systems (ICPADS’02), 203-208. doi:10.1109/ICPADS.2002.1183400. ISBN 0-7695-1760-9

Authors

Keywords

distributed algorithms; message passing; multiprocessor interconnection networks; network routing; performance evaluation; extending dominating node algorithm; recursive doubling; coded path routing; computational demands; large-scale system; message passing; multiport meshes; network size; parallel applications; performance; scalability; scalable broadcast algorithm;

Available Documents