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:

    28 February 2003

  • Publication Status:


  • Publisher

    IEEE Computer Society

  • DOI:


  • Library of Congress:

    QA75 Electronic computers. Computer science


Al-Dubai, A., & Ould-Khaoua, M. (2003). 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



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;

Monthly Views:

Available Documents
  • pdf

    File is currently unavailable , please contact to request a copy


    © 2002 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works

  • Downloadable citations