Research Output
On the design of scalable pipelined broadcasting for mesh networks
  Minimising the communication latency and achieving considerable scalability are of paramount importance when designing high performance broadcast algorithms. Many algorithms for wormhole-switched meshes have been widely reported in the literature. However, most of these algorithms handle broadcast in a sequential manner and do not scale well with the network size. As a consequence, many parallel applications cannot be efficiently supported using existing algorithms. Motivated by these observations, this paper presents a new broadcast algorithm for the all-port mesh networks. The unique feature of the proposed algorithm is its capability of handling broadcast in only one message-passing step irrespective of the network size. Results from a comparative analysis and simulation reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node and Network Partitioning algorithms


Al-Dubai, A., & Ould-Khaoua, M. (2002). On the design of scalable pipelined broadcasting for mesh networks. In High Performance Computing Systems and Applications, 98-105.



multiprocessor interconnection networks; parallel algorithms; pipeline processing; all-port mesh networks; broadcast algorithm; communication latency; message-passing parallel algorithms; scalability;

Monthly Views:

Available Documents
  • pdf

    On the design of scalable pipelined broadcasting for mesh networks


    © 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